A038399 Concatenate first n nonzero Fibonacci numbers in reverse order.

1, 11, 211, 3211, 53211, 853211, 13853211, 2113853211, 342113853211, 55342113853211, 8955342113853211, 1448955342113853211, 2331448955342113853211, 3772331448955342113853211, 6103772331448955342113853211, 9876103772331448955342113853211

Offset: 1

Author

M. I. Petrescu (mipetrescu(AT)yahoo.com)

Keywords

• nonn
• base
• easy
• less

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

Crossrefs

Cf. A000045, A000422, A019523.

Programs

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

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 *)

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

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