This site is supported by donations to The OEIS Foundation.

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A050068 a(n) = a(n-1)+a(m), where m=2n-3-2^(p+1) and 2^p= 4. 10
 1, 3, 4, 5, 9, 10, 14, 23, 37, 38, 42, 51, 65, 102, 144, 209, 353, 354, 358, 367, 381, 418, 460, 525, 669, 1022, 1380, 1761, 2221, 2890, 4270, 6491, 10761, 10762, 10766, 10775, 10789, 10826, 10868, 10933, 11077, 11430, 11788 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Ivan Neretin, Table of n, a(n) for n = 1..8193 MATHEMATICA Fold[Append[#1, #1[[-1]] + #1[[#2]]] &, {1, 3, 4}, Flatten@Table[2 k - 1, {n, 5}, {k, 2^n}]] (* Ivan Neretin, Sep 07 2015 *) CROSSREFS Same as A050036 and A050052 except for second term. Cf. similar sequences with different initial conditions: A050024 (1,1,1), A050028 (1,1,2), A050032 (1,1,3), A050036 (1,1,4), A050040 (1,2,1), A050044 (1,2,2), A050048 (1,2,3), A050052 (1,2,4), A050056 (1,3,1), A050060 (1,3,2), A050064 (1,3,3). Sequence in context: A047249 A228941 A236211 * A250444 A190211 A136120 Adjacent sequences:  A050065 A050066 A050067 * A050069 A050070 A050071 KEYWORD nonn AUTHOR STATUS approved

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