Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A106026
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A106026 A fractal transform of Pell numbers : a(1)=1 then if b(n)<k<=b(n+1) a(k)=b(n+1)-a(k-b(n)) where b(n)=A000129(n). +0
1
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; listen)
OFFSET

1,3

COMMENT

Graphs of a(k) for k=1 up to A000129(n) and n=1,2,3,... present fractal aspects.

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: A138679 A080721 A123588 this_sequence A096078 A140313 A102323

Adjacent sequences: A106023 A106024 A106025 this_sequence A106027 A106028 A106029

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), May 05 2005

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research