The OEIS is supported by the many generous donors to the OEIS Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A109808 a(n) = 2*7^(n-1). 6
 2, 14, 98, 686, 4802, 33614, 235298, 1647086, 11529602, 80707214, 564950498, 3954653486, 27682574402, 193778020814, 1356446145698, 9495123019886, 66465861139202, 465261027974414, 3256827195820898, 22797790370746286, 159584532595224002, 1117091728166568014 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Value of Tutte dichromatic polynomial T_G(0,1) where G is the Cartesian product of the paths P_2 and P_n (n>1). The value of Tutte dichromatic polynomial T_G(0,1) where G is the Cartesian product of the paths P_1 and P_n (n>1) is seen to be 2^(n-1), which is also the number of edge-rooted forests in P_n. In 1956, Andrzej Schinzel showed that for every n >= 2, a(n) is not a value of Euler's function. - Arkadiusz Wesolowski, Oct 20 2013 Apart from first term 2, these are the numbers that satisfy phi(n) = 3*n/7. - Michel Marcus, Jul 14 2015 LINKS Vincenzo Librandi, Table of n, a(n) for n = 1..1000 Tanya Khovanova, Recursive Sequences W. Kook, Edge-rooted forests and alpha-invariant of cone graphs, Discrete Applied Mathematics, Volume 155, Issue 8, 15 April 2007, Pages 1071-1075. Mitchell Paukner, Lucy Pepin, Manda Riehl, and Jarred Wieser, Pattern Avoidance in Task-Precedence Posets, arXiv:1511.00080 [math.CO], 2015-2016. Index entries for linear recurrences with constant coefficients, signature (7). FORMULA a(n) = 2*7^(n-1); a(n) = 7*a(n-1) where a(1) = 2. G.f.: 2*x/(1 - 7*x). - Philippe Deléham, Nov 23 2008 E.g.f.: 2*(exp(7*x) - 1)/7. - Stefano Spezia, May 29 2021 MAPLE a:= n-> 2*7^(n-1): seq(a(n), n=1..30); MATHEMATICA 2*7^Range[0, 40] (* Vladimir Joseph Stephan Orlovsky, Jun 10 2011 *) PROG (PARI) a(n)=7^n*2/7 \\ Charles R Greathouse IV, Jun 10 2011 (Magma) [2*7^(n-1):n in [1..25]]; // Vincenzo Librandi, Sep 15 2011 CROSSREFS Cf. A000420. Sequence in context: A204699 A286445 A322262 * A304444 A247481 A037516 Adjacent sequences:  A109805 A109806 A109807 * A109809 A109810 A109811 KEYWORD nonn,easy AUTHOR Woong Kook (andrewk(AT)math.uri.edu), Aug 16 2005 EXTENSIONS Name changed by Arkadiusz Wesolowski, Oct 20 2013 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 4 12:43 EDT 2022. Contains 357239 sequences. (Running on oeis4.)
{"ft_lang_label":"__label__en","ft_lang_prob":0.59181994,"math_prob":0.7392704,"size":2220,"snap":"2022-40-2023-06","text_gpt3_token_len":871,"char_repetition_ratio":0.077166066,"word_repetition_ratio":0.061452515,"special_character_ratio":0.49684685,"punctuation_ratio":0.21841542,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.97192365,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-10-04T16:46:31Z\",\"WARC-Record-ID\":\"<urn:uuid:7bb13dbc-1d32-4743-b65a-9f5911debc86>\",\"Content-Length\":\"19090\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:9b43f7d1-1e5a-4965-9d5f-15a49df0c2c9>\",\"WARC-Concurrent-To\":\"<urn:uuid:3244cc91-6114-4fb4-a901-80d243713368>\",\"WARC-IP-Address\":\"104.239.138.29\",\"WARC-Target-URI\":\"http://oeis.org/A109808\",\"WARC-Payload-Digest\":\"sha1:4JSGSKB2CNXAJCWR77RIYXCWUK72HGHD\",\"WARC-Block-Digest\":\"sha1:2ZM6TVMULT6NRUV5FCQX4YKQDLXZAGIE\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-40/CC-MAIN-2022-40_segments_1664030337516.13_warc_CC-MAIN-20221004152839-20221004182839-00031.warc.gz\"}"}