id:A083218 - OEIS Search Results

Search: id:A083218

Displaying 1-1 of 1 results found.

page 1

a(n) = n mod (spf(n+1)+1), where spf(n) is the smallest prime factor of n (A020639).

+0
3

1, 2, 0, 4, 2, 6, 1, 0, 0, 10, 2, 12, 1, 2, 0, 16, 2, 18, 1, 0, 0, 22, 2, 0, 1, 2, 0, 28, 2, 30, 1, 0, 0, 4, 2, 36, 1, 2, 0, 40, 2, 42, 1, 0, 0, 46, 2, 0, 1, 2, 0, 52, 2, 0, 1, 0, 0, 58, 2, 60, 1, 2, 0, 4, 2, 66, 1, 0, 0, 70, 2, 72, 1, 2, 0, 4, 2, 78, 1, 0, 0, 82, 2, 0, 1, 2, 0, 88, 2, 2, 1, 0, 0, 4, 2, 96 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`a(n) = n iff n+1 is prime: a(A006093(k))=A006093(k).`
	CROSSREFS	`Cf. A057237.` `Sequence in context: A097042 A097945 A153733 this_sequence A139716 A163123 A068773` `Adjacent sequences: A083215 A083216 A083217 this_sequence A083219 A083220 A083221`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 22 2003`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research