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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A087100 A000225 (2^n - 1) interlaced with A008593 (11n). 1
 0, 1, 11, 3, 22, 7, 33, 15, 44, 31, 55, 63, 66, 127, 77, 255, 88, 511, 99, 1023, 110, 2047, 121, 4095, 132, 8191, 143, 16383, 154, 32767, 165, 65535, 176, 131071, 187, 262143, 198, 524287, 209, 1048575, 220, 2097151, 231, 4194303, 242, 8388607, 253 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Index entries for linear recurrences with constant coefficients, signature (0,4,0,-5,0,2). FORMULA From Chai Wah Wu, Feb 02 2021: (Start) a(n) = 4*a(n-2) - 5*a(n-4) + 2*a(n-6) for n > 5. G.f.: x*(22*x^3 + x^2 - 11*x - 1)/((x - 1)^2*(x + 1)^2*(2*x^2 - 1)). (End) MATHEMATICA Rest[With[{nn=30}, Riffle[2^Range[0, nn]-1, 11Range[0, nn]]]] (* Harvey P. Dale, Aug 15 2011 *) CROSSREFS Cf. A063914, A087098, A086848. Sequence in context: A088653 A317311 A107598 * A298256 A298927 A102380 Adjacent sequences:  A087097 A087098 A087099 * A087101 A087102 A087103 KEYWORD easy,nonn AUTHOR Jeremy Gardiner, Aug 10 2003 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 22:12 EST 2021. Contains 349435 sequences. (Running on oeis4.)