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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A131293 Concatenate a(n-2) and a(n-1) to get a(n); start with a(0)=0, a(1)=1, delete the leading zero. Also Fib(n)-number of '1's. 2
0, 1, 1, 11, 111, 11111, 11111111, 1111111111111, 111111111111111111111, 1111111111111111111111111111111111, 1111111111111111111111111111111111111111111111111111111 (list; graph; refs; listen; history; internal format)
OFFSET

0,4

COMMENTS

Interpreted as base-2 numbers the result is A063896.

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 0..18

FORMULA

a(n)=a(n-2)*10^ceiling(log_10(a(n-1)))+a(n-1) for n>1.

a(n)=(10^Fib(n)-1)/9 where Fib(n)=A000045(n).

EXAMPLE

a(3)=11, a(4)=111, so a(5)=a(4)a(3)=11111.

MATHEMATICA

Join[{0}, FromDigits/@(PadLeft[{}, #, 1]&/@Fibonacci[Range[10]])] (* From Harvey P. Dale, Aug 28 2011 *)

PROG

(MAGMA) [(10^Fibonacci(n)-1)/9: n in [0..10]]; // Vincenzo Librandi, Aug 29 2011

CROSSREFS

Cf. A000045, A061107.

Sequence in context: A015468 A037842 * A108047 A144784 A030175 A058949

Adjacent sequences:  A131290 A131291 A131292 * A131294 A131295 A131296

KEYWORD

nonn

AUTHOR

Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Jun 26 2007

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.