|
|
A113765
|
|
Define the first two terms to be 1 and 7. All the other terms are obtained by concatenating the two previous terms.
|
|
0
|
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
a(n) has Fibonacci(n) digits and the sum of all digits is given by Fibonacci(n-2)+7*Fibonacci(n-1) for all n>4. - Stefan Steinerberger, Jan 21 2006
|
|
LINKS
|
|
|
EXAMPLE
|
The third term is 17 and it is obtained by concatenating the two previous terms 1 and 7.
|
|
CROSSREFS
|
Cf. A000045 - the Fibonacci numbers.
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|