[go: up one dir, main page]

login
A038399
Concatenate first n nonzero Fibonacci numbers in reverse order.
8
1, 11, 211, 3211, 53211, 853211, 13853211, 2113853211, 342113853211, 55342113853211, 8955342113853211, 1448955342113853211, 2331448955342113853211, 3772331448955342113853211, 6103772331448955342113853211, 9876103772331448955342113853211
OFFSET
1,2
REFERENCES
Mihaly Bencze [Beneze], L. Tutescu, Some Notions and Questions in Number Theory, Sequence 7.
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 1..96
MATHEMATICA
Module[{nn=20, fibs}, fibs=Fibonacci[Range[nn]]; Table[FromDigits[ Flatten[ IntegerDigits/@ Reverse[Take[fibs, n]]]], {n, nn}]] (* Harvey P. Dale, Aug 30 2016 *)
PROG
(Haskell)
a038399 n = a038399_list !! (n-1)
a038399_list = h "" $ tail a000045_list where
h xs (f:fs) = (read ys :: Integer) : h ys fs
where ys = show f ++ xs
-- Reinhard Zumkeller, Mar 01 2014
(PARI) a(n) = my(t=fibonacci(n)); forstep(k=n-1, 1, -1, t=t*10^#Str(fibonacci(k))+fibonacci(k)); t; \\ Michel Marcus, Apr 06 2024
CROSSREFS
KEYWORD
nonn,base,easy,less
AUTHOR
M. I. Petrescu (mipetrescu(AT)yahoo.com)
EXTENSIONS
More terms from Andrew Gacek (andrew(AT)dgi.net), Feb 21 2000
Offset changed by Reinhard Zumkeller, Mar 01 2014
More terms from Harvey P. Dale, Aug 30 2016
STATUS
approved