id:A080063 - OEIS Search Results

Search: id:A080063

Displaying 1-1 of 1 results found.

page 1

n mod (spf(n)+1), where spf(n) is the smallest prime dividing n (A020639).

+0
3

1, 2, 3, 1, 5, 0, 7, 2, 1, 1, 11, 0, 13, 2, 3, 1, 17, 0, 19, 2, 1, 1, 23, 0, 1, 2, 3, 1, 29, 0, 31, 2, 1, 1, 5, 0, 37, 2, 3, 1, 41, 0, 43, 2, 1, 1, 47, 0, 1, 2, 3, 1, 53, 0, 1, 2, 1, 1, 59, 0, 61, 2, 3, 1, 5, 0, 67, 2, 1, 1, 71, 0, 73, 2, 3, 1, 5, 0, 79, 2, 1, 1, 83, 0, 1, 2, 3, 1, 89, 0, 3, 2, 1, 1, 5, 0 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`a(n) = 0 iff n mod 6 = 0 (A008588);` `a(n) = 2 iff n mod 6 = 2 (A016933);` `for n>1: a(n)=n iff n is prime (A000040, A008578).`
	CROSSREFS	`Cf. A080064, A080065, A010872, A010873, A010875, A010877, A010881.` `Sequence in context: A079639 A104694 A125182 this_sequence A140706 A139764 A089026` `Adjacent sequences: A080060 A080061 A080062 this_sequence A080064 A080065 A080066`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jan 24 2003`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research