login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A126697 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, 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; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Table of n, a(n) for n=0..56.

MATHEMATICA

f[l_List] := Append[l, l[[ -1]] + Max @@ Intersection[l, Divisors[Length[l]]]]; Nest[f, {1}, 60] (* Ray Chandler, Feb 19 2007 *)

CROSSREFS

Cf. A123090.

Sequence in context: A060167 A234588 A118550 * A162406 A129282 A073153

Adjacent sequences:  A126694 A126695 A126696 * A126698 A126699 A126700

KEYWORD

nonn

AUTHOR

Leroy Quet, Feb 15 2007

EXTENSIONS

Extended by Ray Chandler, Feb 19 2007

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 22 01:28 EST 2022. Contains 350481 sequences. (Running on oeis4.)