|
%I #34 Feb 19 2023 16:29:30
%S 1,11,112,1123,11235,112358,11235813,1123581321,112358132134,
%T 11235813213455,1123581321345589,1123581321345589144,
%U 1123581321345589144233,1123581321345589144233377,1123581321345589144233377610,1123581321345589144233377610987
%N Concatenation of Fibonacci(1) through Fibonacci(n).
%C For n<=800, only a(2) and a(4) are primes. - _Dmitry Kamenetsky_, Feb 25 2009
%C a(n) has about kn(n+1) digits, where k = log phi/log 100 = 0.10449... - _Charles R Greathouse IV_, Sep 19 2012
%D S. Smarandoiu, Convergence of Smarandache continued fractions, Abstract 96T-11-195, Abstracts Amer. Math. Soc., 17 (No. 4, 1996), 680.
%H Reinhard Zumkeller, <a href="/A019523/b019523.txt">Table of n, a(n) for n = 1..96</a>
%H F. Smarandache, <a href="http://www.gallup.unm.edu/~smarandache/CP2.pdf">Collected Papers, Vol. II</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/FibonacciNumber.html">Fibonacci Number</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/ConsecutiveNumberSequences.html">Consecutive Number Sequences</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/SmarandacheSequences.html">Smarandache Sequences</a>
%H <a href="/index/Mo#MWP">Index entries for sequences related to Most Wanted Primes video</a>
%F a(n) = a(n-1)*10^A055642(A000045(n)) + A000045(n). - _José de Jesús Camacho Medina_, Dec 16 2016
%t Table[FromDigits[Flatten[IntegerDigits[Fibonacci[Range[n]]]]], {n,25}] (* _G. C. Greubel_, Nov 30 2016 *)
%o (Haskell)
%o a019523 n = read $ concatMap show $ take n $ tail a000045_list :: Integer
%o -- _Reinhard Zumkeller_, Mar 01 2014
%o (Magma) [Seqint(Reverse(&cat[Reverse(Intseq(Fibonacci(k))): k in [1..n]])): n in [1..20]]; // _Vincenzo Librandi_, Dec 18 2016
%Y Cf. A000045, A038399.
%K base,nonn
%O 1,2
%A R. Muller
| 