id:A080064 - OEIS Search Results

Search: id:A080064

Displaying 1-1 of 1 results found.

page 1

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

+0
3

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 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`A080063(m) = 1 iff m = a(k) for some k.`
	CROSSREFS	`Cf. A080065.` `Sequence in context: A050943 A010406 A010451 this_sequence A117570 A155566 A102837` `Adjacent sequences: A080061 A080062 A080063 this_sequence A080065 A080066 A080067`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jan 24 2003`

page 1

Search completed in 0.002 seconds

Last modified December 6 22:55 EST 2009. Contains 170429 sequences.

AT&T Labs Research