login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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
(list; graph; refs; listen; history; text; internal format)
OFFSET
1,5
LINKS
CROSSREFS
Sequence in context: A263259 A137163 A344233 * A268187 A232440 A355749
KEYWORD
nonn
AUTHOR
Labos Elemer, Jun 28 2002
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 18 16:17 EDT 2024. Contains 376000 sequences. (Running on oeis4.)