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!)
A133903 a(n) = a(n-1) + A000005(n-1) if a(n-1) is not divisible by 3, otherwise a(n) = a(n-1)/3. 1
1, 2, 4, 6, 2, 4, 8, 10, 14, 17, 21, 7, 13, 15, 5, 9, 3, 1, 7, 9, 3, 1, 5, 7, 15, 5, 9, 3, 1, 3, 1, 3, 1, 5, 9, 3, 1, 3, 1, 5, 13, 15, 5, 7, 13, 19, 23, 25, 35, 38, 44, 48, 16, 18, 6, 2, 10, 14, 18, 6, 2, 4, 8, 14, 21, 7, 15, 5, 11, 15, 5, 7, 19, 21, 7, 13, 19, 23 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
MATHEMATICA
Nest[Append[#1, If[Divisible[Last[#1], 3], Last[#1]/3, Last[#1] + DivisorSigma[0, #2]]] & @@ {#, Length[#]} &, {1}, 77] (* Michael De Vlieger, Mar 21 2022 *)
PROG
(PARI) lista(nn) = {my(va = vector(nn)); va[1] = 1; for (n=2, nn, va[n] = if (va[n-1] % 3, va[n-1] + numdiv(n-1), va[n-1]/3); ); va; } \\ Michel Marcus, Nov 28 2020
CROSSREFS
Cf. A000005 (number of divisors).
Sequence in context: A050975 A053446 A354577 * A278263 A236188 A352599
KEYWORD
easy,nonn
AUTHOR
Ctibor O. Zizka, Jan 07 2008
EXTENSIONS
Corrected and extended by Michel Marcus, Nov 28 2020
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 24 15:57 EDT 2024. Contains 371961 sequences. (Running on oeis4.)