id:A111267 - OEIS Search Results

Search: id:A111267

Displaying 1-1 of 1 results found.

page 1

Let q(n) := prime(1)+...+prime(n); a(n) = smallest divisor of q(n) not already in sequence.

+0
8

1, 5, 2, 17, 4, 41, 29, 7, 10, 3, 8, 197, 14, 281, 82, 127, 11, 167, 71, 9, 89, 113, 19, 107, 20, 27, 16, 457, 37, 59, 40, 617, 28, 709, 569, 809, 34, 67, 31, 21, 23, 383, 214, 1277, 38, 1409, 317, 79, 13, 43, 25, 69, 22, 2027, 3169, 161, 6, 193, 3709, 7699, 26, 331, 613, 8893 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`Does every number appear?` `A basic sequence related to additive structure of primes.`
	MAPLE	`with(numtheory); M:=500; p0:=2; a[1]:=1; for n from 2 to M do p0:=p0+ithprime(n); t1:=divisors(p0); t2:=nops(t1); for i from 1 to t2 do d:=t1[i]; hit:=0; for j from 1 to n-1 do if a[j]=d then hit:=1; break; fi; od: if hit = 0 then a[n]:=d; break; fi; od: od: s1:=[seq(a[n], n=1..M)];`
	CROSSREFS	`For records see A111268, A111084. For inverse see A111229.` `Sequence in context: A104634 A060422 A128142 this_sequence A146343 A146363 A087958` `Adjacent sequences: A111264 A111265 A111266 this_sequence A111268 A111269 A111270`
	KEYWORD	`nonn`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), Nov 03 2005`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research