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

A080064
Numbers n such that n == 1 modulo (spf(n)+1), where spf(m) is the smallest prime dividing m (A020639).
2
1, 4, 9, 10, 16, 21, 22, 25, 28, 33, 34, 40, 45, 46, 49, 52, 55, 57, 58, 64, 69, 70, 76, 81, 82, 85, 88, 93, 94, 100, 105, 106, 112, 115, 117, 118, 121, 124, 129, 130, 136, 141, 142, 145, 148, 153, 154, 160, 161, 165, 166, 169, 172, 175, 177, 178, 184, 189, 190, 196
OFFSET
1,2
COMMENTS
A080063(m) = 1 iff m = a(k) for some k.
CROSSREFS
Cf. A080065.
Sequence in context: A050943 A010406 A010451 * A329609 A340784 A260963
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Jan 24 2003
STATUS
approved