Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A015468
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A015468 q-Fibonacci numbers for q=10. +0
1
0, 1, 1, 11, 111, 11111, 1121111, 1112221111, 1122223221111, 11123333333221111, 112233445444433221111, 11123445566666555433221111, 1122345577889898877665433221111 (list; graph; listen)
OFFSET

0,4

FORMULA

a(n) = a(n-1) + 10^(n-2) a(n-2).

CROSSREFS

Sequence in context: A083441 A031974 A117293 this_sequence A037842 A131293 A108047

Adjacent sequences: A015465 A015466 A015467 this_sequence A015469 A015470 A015471

KEYWORD

nonn,easy

AUTHOR

Olivier Gerard (ogerard(AT)ext.jussieu.fr)

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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research