login
This site is supported by donations 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). 2
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; internal format)
OFFSET

1,1

COMMENTS

A080063(m) = 3 iff m = a(k) for some k.

CROSSREFS

Cf. A080064.

Sequence in context: A027179 A121250 A105549 * A017557 A147041 A002259

Adjacent sequences:  A080062 A080063 A080064 * A080066 A080067 A080068

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jan 24 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 02:48 EST 2012. Contains 205978 sequences.