id:A085415 - OEIS Search Results

Search: id:A085415

Displaying 1-1 of 1 results found.

page 1

Take prime[n] and continue adding 1, 2, ..., a(n) until one reaches a prime.

+0
4

1, 4, 3, 3, 3, 3, 3, 4, 3, 12, 3, 3, 3, 4, 3, 3, 12, 3, 3, 8, 3, 4, 3, 12, 3, 3, 3, 3, 7, 8, 4, 3, 8, 4, 12, 3, 3, 4, 3, 3, 12, 4, 3, 3, 8, 7, 7, 3, 3, 4, 3, 12, 4, 3, 3, 3, 12, 3, 3, 8, 4, 11, 3, 3, 8, 8, 3, 4, 3, 4, 3, 15, 3, 3, 4, 3, 12, 8, 11, 4, 24, 4, 8, 3, 4, 3, 15, 3, 3, 7, 8, 12, 8, 11, 4, 3, 12, 8 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`Resulting primes in A085416. See also A085417, A085418.`
	FORMULA	`Prime[n]+m*(1+m)/2 is a prime for some m>0.`
	EXAMPLE	`a(2)=4 because prime[2]+(1+2+3+4)=3+10=13 is a prime`
	CROSSREFS	`Cf. A085416, A085417, A085418.` `Sequence in context: A143487 A031350 A031353 this_sequence A059124 A026858 A129344` `Adjacent sequences: A085412 A085413 A085414 this_sequence A085416 A085417 A085418`
	KEYWORD	`easy,nonn`
	AUTHOR	`Zak Seidov (zakseidov(AT)yahoo.com), Jun 29 2003`

page 1

Search completed in 0.002 seconds

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.

AT&T Labs Research