The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A129098 a(n) = A129095(2^n + 2^(n-1) - 1) for n>=1. 4
 1, 5, 23, 135, 1119, 14319, 300015, 10636463, 652217135, 70382845743, 13551477257519, 4706105734658351, 2973879284783561007, 3444999327807280048431, 7362415635261959807011119, 29188908702092573515760044335 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS b(n)=A129095(n) obeys the recurrence: b(n) = b(n/2) (n even), b(n) = 2*b(n-1) + b(n-2) (n odd >1), with b(1) = 1. LINKS MATHEMATICA Block[{e = 18, s}, s = Nest[Append[#1, If[EvenQ[#2], #1[[#2/2]], 2 #1[[-1]] + #1[[-2]] ] ] & @@ {#, Length@ # + 1} &, {1}, 2^e]; Array[s[[2^# + 2^(# - 1) - 1]] &, e - 1]] (* Michael De Vlieger, Mar 10 2020 *) PROG (PARI) CROSSREFS Cf. A129095, A129096, A129097, A129099. Sequence in context: A077240 A281231 A244786 * A047049 A020034 A128884 Adjacent sequences:  A129095 A129096 A129097 * A129099 A129100 A129101 KEYWORD easy,nonn AUTHOR Paul D. Hanna, Apr 11 2007 EXTENSIONS a(16) from Michael De Vlieger, Mar 10 2020. 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 1 12:50 EST 2020. Contains 338833 sequences. (Running on oeis4.)