login

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”).

A283801
Concatenation of the first n odd composite numbers (A071904).
1
9, 915, 91521, 9152125, 915212527, 91521252733, 9152125273335, 915212527333539, 91521252733353945, 9152125273335394549, 915212527333539454951, 91521252733353945495155, 9152125273335394549515557, 915212527333539454951555763, 91521252733353945495155576365
OFFSET
1,1
COMMENTS
There are 3 primes in the first 5028 terms of this sequence, see A283802.
LINKS
Eric Weisstein's World of Mathematics, Consecutive Number Sequences
MATHEMATICA
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]
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 *)
CROSSREFS
KEYWORD
base,nonn,easy
AUTHOR
XU Pingya, Mar 17 2017
STATUS
approved