The OEIS is supported by the many generous donors to the OEIS 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 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A106026 A fractal transform of Pell numbers : a(1)=1 then if b(n)
 1, 1, 4, 4, 1, 11, 11, 8, 8, 11, 1, 1, 28, 28, 25, 25, 28, 18, 18, 21, 21, 18, 28, 28, 1, 1, 4, 4, 1, 69, 69, 66, 66, 69, 59, 59, 62, 62, 59, 69, 69, 42, 42, 45, 45, 42, 52, 52, 49, 49, 52, 42, 42, 69, 69, 66, 66, 69, 1, 1, 4, 4, 1, 11, 11, 8, 8, 11, 1, 1, 168, 168, 165, 165, 168, 158 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS Graphs of a(k) for k=1 up to A000129(n) and n=1,2,3,... present fractal aspects. LINKS Table of n, a(n) for n=1..76. FORMULA Among many properties a(A000129(n))=1 CROSSREFS Cf. A105669 (fractal transform of Fibonacci's numbers), A105670 (fractal transform of powers of 2), A105672(fractal transform of powers of 3). Sequence in context: A243594 A360707 A365674 * A096078 A140313 A102323 Adjacent sequences: A106023 A106024 A106025 * A106027 A106028 A106029 KEYWORD nonn AUTHOR Benoit Cloitre, May 05 2005 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 December 3 01:24 EST 2023. Contains 367526 sequences. (Running on oeis4.)