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

A072625
a(n) = prime(n) mod ceiling(log(prime(n))).
0
0, 1, 1, 1, 2, 1, 2, 1, 3, 1, 3, 1, 1, 3, 3, 1, 4, 1, 2, 1, 3, 4, 3, 4, 2, 1, 3, 2, 4, 3, 2, 1, 2, 4, 5, 1, 1, 1, 5, 5, 5, 1, 5, 1, 5, 1, 1, 1, 5, 1, 5, 5, 1, 5, 5, 5, 5, 1, 1, 5, 1, 5, 1, 5, 1, 5, 1, 1, 5, 1, 5, 5, 1, 1, 1, 5, 5, 1, 5, 3, 6, 1, 4, 6, 5, 2, 1, 2, 6, 1, 5, 3, 4, 1, 2, 6, 5, 3, 5, 2, 1, 4, 3, 2, 4
OFFSET
1,5
CROSSREFS
Sequence in context: A263259 A137163 A344233 * A268187 A232440 A355749
KEYWORD
nonn
AUTHOR
Labos Elemer, Jun 28 2002
STATUS
approved