id:A136851 - OEIS Search Results

Search: id:A136851

Displaying 1-1 of 1 results found.

page 1

a(1)=3 (smallest odd prime); for n>=2, a(n) = smallest prime such that 1) a(n)-a(n-1) = prime if odd, else double of prime and 2) for sum_{ k = 1..n } a(k) = prime if odd, else double of prime.

+0
1

3, 7, 13, 23, 37, 59, 97, 107, 241, 251, 613, 911, 937, 983, 997, 1223, 1381, 1499, 1621, 1979, 2281, 2399, 2521, 2663, 2677, 3299, 3361, 3623, 3637, 3671, 3697, 3803, 3889, 3911, 4273, 4451, 4729, 4787, 4909, 5003, 5821, 5927, 6229, 6791, 6793, 6827, 6829 (list; graph; listen)

	OFFSET	`1,1`
	EXAMPLE	`For n = 3 a(3)-a(2) =13-7=6 =2*3 = double of prime, 3+7+13=23 = prime`
	CROSSREFS	`Sequence in context: A058682 A081995 A053599 this_sequence A155339 A122886 A154691` `Adjacent sequences: A136848 A136849 A136850 this_sequence A136852 A136853 A136854`
	KEYWORD	`easy,nonn`
	AUTHOR	`Philippe Lallouet (philip.lallouet(AT)orange.fr), Apr 03 2008`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research