id:A108415 - OEIS Search Results

Search: id:A108415

Displaying 1-1 of 1 results found.

page 1

a(n) = 1, 2 or 3 (resp.) if prime(n) is weak, balanced or strong (resp.).

+0
1

1, 2, 1, 3, 1, 3, 1, 1, 3, 1, 3, 3, 1, 1, 2, 3, 1, 3, 3, 1, 3, 1, 1, 3, 3, 1, 3, 1, 1, 3, 1, 3, 1, 3, 1, 2, 3, 1, 2, 3, 1, 3, 1, 3, 1, 2, 3, 3, 1, 1, 3, 1, 3, 2, 2, 3, 1, 3, 3, 1, 1, 3, 3, 1, 1, 3, 1, 3, 1, 1, 1, 3, 2, 3, 1, 1, 3, 1, 1, 3, 1, 3, 1, 3, 1, 1, 3, 3, 1, 1, 3, 3, 1, 3, 1, 1, 3, 1, 3, 1, 3, 2, 3, 1, 1 (list; graph; listen)

	OFFSET	`2,2`
	COMMENT	`n >= 2: a(n) = 1, 2 or 3 (resp.) if n-th prime is in A051635, A006562 or A051634 (resp.).`
	MATHEMATICA	`A108415[n_]:=2+Sign[Prime[n]-1/2(Prime[n-1]+Prime[n+1])]`
	CROSSREFS	`Cf. A051635, A006562, A051634.` `Sequence in context: A045898 A036262 A046924 this_sequence A136644 A111963 A078079` `Adjacent sequences: A108412 A108413 A108414 this_sequence A108416 A108417 A108418`
	KEYWORD	`nonn`
	AUTHOR	`Zak Seidov (zakseidov(AT)yahoo.com), Jun 02 2005`

page 1

Search completed in 0.002 seconds

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.

AT&T Labs Research