id:A126697 - OEIS Search Results

Search: id:A126697

Displaying 1-1 of 1 results found.

page 1

a(0)=1. For n>=1, a(n) = a(n-1) + (largest divisor of n which occurs among the earlier terms of the sequence).

+0
1

1, 2, 4, 5, 9, 14, 16, 17, 21, 30, 35, 36, 40, 41, 55, 60, 76, 93, 102, 103, 108, 129, 131, 132, 136, 141, 143, 152, 166, 167, 197, 198, 214, 215, 232, 267, 303, 304, 306, 307, 347, 388, 409, 410, 414, 423, 425, 426, 442, 443, 448, 465, 469, 470, 479, 534, 548 (list; graph; listen)

	OFFSET	`0,2`
	MATHEMATICA	`f[l_List] := Append[l, l[[ -1]] + Max @@ Intersection[l, Divisors[Length[l]]]]; Nest[f, {1}, 60] (Chandler)`
	CROSSREFS	`Cf. A123090.` `Sequence in context: A068370 A060167 A118550 this_sequence A129282 A073153 A073154` `Adjacent sequences: A126694 A126695 A126696 this_sequence A126698 A126699 A126700`
	KEYWORD	`nonn`
	AUTHOR	`Leroy Quet (qq-quet(AT)mindspring.com), Feb 15 2007`
	EXTENSIONS	`Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Feb 19 2007`

page 1

Search completed in 0.002 seconds

Last modified September 6 00:03 EDT 2008. Contains 143485 sequences.

AT&T Labs Research