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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A080065 Numbers n such that n == 3 modulo (spf(n)+1), where spf(m) is the smallest prime dividing m (A020639). 3
3, 15, 27, 39, 51, 63, 75, 87, 91, 99, 111, 123, 135, 147, 159, 171, 183, 195, 203, 207, 219, 231, 243, 255, 259, 267, 279, 291, 303, 315, 327, 339, 351, 363, 371, 375, 387, 399, 411, 423, 427, 435, 447, 459, 471, 483, 495, 507, 519, 531, 539, 543, 555, 567 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
A080063(m) = 3 iff m = a(k) for some k.
LINKS
MATHEMATICA
Select[Range[600], Mod[#, FactorInteger[#][[1, 1]]+1]==3&] (* Harvey P. Dale, Aug 15 2013 *)
CROSSREFS
Cf. A080064.
Sequence in context: A110703 A121250 A105549 * A017557 A147041 A347536
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Jan 24 2003
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | 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 March 3 10:34 EST 2024. Contains 370511 sequences. (Running on oeis4.)