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!)
A308469 a(1) = 1, a(2)=2, a(n) = a(n-1) + gcd(a(n-2), n-2). 0
1, 2, 3, 5, 8, 9, 10, 13, 14, 15, 16, 21, 22, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 45, 46, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 93, 94, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Apparently, the distinct values of a(n)-n for n > 7 correspond to A190894. - Rémy Sigrist, Jul 23 2019
LINKS
MATHEMATICA
a[1] = 1; a[2] = 2; a[n_] := a[n] = a[n-1] + GCD[a[n-2], n-2]; Array[a, 70] (* Amiram Eldar, Aug 01 2019 *)
CROSSREFS
Sequence in context: A047607 A113051 A047372 * A247547 A096974 A286486
KEYWORD
nonn
AUTHOR
Thomas Kerscher, May 29 2019
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 13:02 EDT 2024. Contains 371969 sequences. (Running on oeis4.)