id:A080065 - OEIS Search Results

Search: id:A080065

Displaying 1-1 of 1 results found.

page 1

Numbers n such that n == 3 modulo (spf(n)+1), where spf(m) is the smallest prime dividing m (A020639).

+0
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; listen)

	OFFSET	`1,1`
	COMMENT	`A080063(m) = 3 iff m = a(k) for some k.`
	CROSSREFS	`Cf. A080064.` `Adjacent sequences: A080062 A080063 A080064 this_sequence A080066 A080067 A080068` `Sequence in context: A027179 A121250 A105549 this_sequence A017557 A002259 A050848`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jan 24 2003`

page 1

Search completed in 0.002 seconds

Last modified October 11 09:12 EDT 2008. Contains 144832 sequences.

AT&T Labs Research