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

A168255
n appears n-th nonprime number times.
1
1, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10
OFFSET
1,2
COMMENTS
n appears A018252(n) times.
LINKS
MATHEMATICA
Module[{nn=20, npn}, npn=Select[Range[nn], !PrimeQ[#]&]; Table[#[[2]], #[[1]]]&/@ Thread[{npn, Range[Length[npn]]}]]//Flatten (* Harvey P. Dale, Dec 19 2021 *)
CROSSREFS
Sequence in context: A090532 A003058 A000194 * A097429 A100617 A076471
KEYWORD
nonn,easy,less
AUTHOR
Jaroslav Krizek, Nov 21 2009
STATUS
approved