login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A110779 Fractalisation of e. 6
2, 2, 7, 2, 1, 7, 8, 2, 2, 1, 8, 7, 1, 8, 8, 2, 2, 2, 8, 1, 4, 8, 5, 7, 9, 1, 0, 8, 4, 8, 5, 2, 2, 2, 3, 2, 5, 8, 3, 1, 6, 4, 0, 8, 2, 5, 8, 7, 7, 9, 4, 1, 7, 0, 1, 8, 3, 4, 5, 8, 2, 5, 6, 2, 6, 2, 2, 2, 4, 3, 9 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

Self-descriptive sequence: even terms are the sequence itself, odd terms are the digits of the decimal expansion of e.

LINKS

C. Kimberling, Fractal sequences.

FORMULA

a(2n)=a(n); a(2n+1)=digits of e.

CROSSREFS

Cf. A003602.

Sequence in context: A013671 A019807 A063706 * A121708 A138069 A082837

Adjacent sequences:  A110776 A110777 A110778 * A110780 A110781 A110782

KEYWORD

easy,nonn,base

AUTHOR

Alexandre Wajnberg (alexandre.wajnberg(AT)skynet.be), Sep 15 2005

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

Content is available under The OEIS End-User License Agreement .

Last modified February 17 21:13 EST 2012. Contains 206085 sequences.