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

A095959
a(n) = n-th prime modulo 30.
3
2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 1, 7, 11, 13, 17, 23, 29, 1, 7, 11, 13, 19, 23, 29, 7, 11, 13, 17, 19, 23, 7, 11, 17, 19, 29, 1, 7, 13, 17, 23, 29, 1, 11, 13, 17, 19, 1, 13, 17, 19, 23, 29, 1, 11, 17, 23, 29, 1, 7, 11, 13, 23, 7, 11, 13, 17, 1, 7, 17, 19, 23, 29, 7, 13, 19
OFFSET
1,1
COMMENTS
A002110(3) = 2*3*5 = 30; range for n>3: {1,7,11,13,17,19,23,29} of size 8 = A000720(30) - #{2,3,5} + #{1} = 10 - 3 + 1 = A000010(30).
LINKS
FORMULA
Sum_k={1..n} a(k) ~ 15*n. - Amiram Eldar, Dec 13 2024
MATHEMATICA
Mod[Prime[Range[80]], 30] (* Harvey P. Dale, Jul 21 2013 *)
PROG
(Magma) [p mod(30): p in PrimesUpTo(500)]; // Vincenzo Librandi, May 07 2014
CROSSREFS
Cf. similar sequences listed in A242119.
Sequence in context: A164574 A344023 A079603 * A359802 A028905 A374467
KEYWORD
nonn,easy
AUTHOR
Reinhard Zumkeller, Jul 14 2004
STATUS
approved