Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #15 Mar 26 2017 04:36:26
%S 9,915,91521,9152125,915212527,91521252733,9152125273335,
%T 915212527333539,91521252733353945,9152125273335394549,
%U 915212527333539454951,91521252733353945495155,9152125273335394549515557,915212527333539454951555763,91521252733353945495155576365
%N Concatenation of the first n odd composite numbers (A071904).
%C There are 3 primes in the first 5028 terms of this sequence, see A283802.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/ConsecutiveNumberSequences.html">Consecutive Number Sequences</a>
%t bb[1]=9;bb[n_]:=bb[n]=Which[PrimeQ[bb[n-1]+2]==False,bb[n-1]+2,PrimeQ[bb[n-1]+4]==False,bb[n-1]+4,True,bb[n-1]+6];coc[n_]:=FromDigits[Flatten[IntegerDigits[Table[bb[k],{k,1,n}]]]];Table[coc[n],14]
%t f[n_] := Block[{oc = cc = 0, k = 2}, While[oc <= n, If[ OddQ@ k && !PrimeQ@ k, cc = cc*10^IntegerLength[k] +k; oc++]; k++]; cc]; Array[f, 14] (* _Robert G. Wilson v_, Mar 17 2017 *)
%Y Cf. A071904, A089933, A132932.
%K base,nonn,easy
%O 1,1
%A _XU Pingya_, Mar 17 2017