id:A076973 - OEIS Search Results

Search: id:A076973

Displaying 1-1 of 1 results found.

page 1

Starting with 2, largest prime divisor of the sum of all previous terms.

+0
3

2, 2, 2, 3, 3, 3, 5, 5, 5, 5, 7, 7, 7, 7, 7, 7, 11, 11, 11, 11, 11, 11, 13, 13, 13, 13, 13, 13, 17, 17, 17, 17, 17, 17, 19, 19, 19, 19, 19, 19, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 29, 29, 29, 29, 29, 29, 29, 29, 31, 31, 31, 31, 31, 31, 31, 31, 37, 37, 37, 37, 37, 37, 37, 37 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`Conjecture: start from any initial value a(1)=m>=2 and define a(n) to be the largest prime factor of a(1)+a(2)+...+a(n-1); then a(n)=n/2+O(log(n)) and there are infinitely primes p such that a(2p)=p. - Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 04 2003`
	CROSSREFS	`From the third term onwards the sequence coincides with A076272.` `Adjacent sequences: A076970 A076971 A076972 this_sequence A076974 A076975 A076976` `Sequence in context: A029060 A029160 A032562 this_sequence A008649 A008650 A062051`
	KEYWORD	`nonn`
	AUTHOR	`Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Oct 22 2002`
	EXTENSIONS	`More terms from Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de), Jan 22 2003`

page 1

Search completed in 0.002 seconds

Last modified October 15 09:18 EDT 2008. Contains 145015 sequences.

AT&T Labs Research