OFFSET
1,2
COMMENTS
For n<=800, only a(2) and a(4) are primes. - Dmitry Kamenetsky, Feb 25 2009
a(n) has about kn(n+1) digits, where k = log phi/log 100 = 0.10449... - Charles R Greathouse IV, Sep 19 2012
REFERENCES
S. Smarandoiu, Convergence of Smarandache continued fractions, Abstract 96T-11-195, Abstracts Amer. Math. Soc., 17 (No. 4, 1996), 680.
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 1..96
F. Smarandache, Collected Papers, Vol. II
Eric Weisstein's World of Mathematics, Fibonacci Number
Eric Weisstein's World of Mathematics, Consecutive Number Sequences
Eric Weisstein's World of Mathematics, Smarandache Sequences
FORMULA
MATHEMATICA
Table[FromDigits[Flatten[IntegerDigits[Fibonacci[Range[n]]]]], {n, 25}] (* G. C. Greubel, Nov 30 2016 *)
PROG
(Haskell)
a019523 n = read $ concatMap show $ take n $ tail a000045_list :: Integer
-- Reinhard Zumkeller, Mar 01 2014
(Magma) [Seqint(Reverse(&cat[Reverse(Intseq(Fibonacci(k))): k in [1..n]])): n in [1..20]]; // Vincenzo Librandi, Dec 18 2016
CROSSREFS
KEYWORD
base,nonn
AUTHOR
R. Muller
STATUS
approved