login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A133904 a(n)= gcd(a(n-1),n)*a(n-1) + d(n) if a(n-1) is not divisible by 2 else a(n)= a(n-1)/2, where gcd denotes common divisor, d(n) is number of divisors of n. 0
1, 2, 1, 3, 6, 3, 13, 15, 19, 22, 11, 123, 375, 377, 381, 1147, 1152, 576, 288, 144, 72, 36, 18, 9, 17, 20, 10, 5, 11, 13, 21, 23, 29, 33, 37, 41, 50, 25, 29, 33, 41, 1683, 5055, 5057, 5063, 5069, 5073, 5075, 5085, 5088, 2544, 1272, 636, 368, 184, 92, 46, 23 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..58.

CROSSREFS

Cf. A001222, A000005.

Sequence in context: A221918 A193897 A226122 * A245182 A209160 A340406

Adjacent sequences:  A133901 A133902 A133903 * A133905 A133906 A133907

KEYWORD

nonn

AUTHOR

Ctibor O. Zizka, Jan 07 2008

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 November 28 16:42 EST 2021. Contains 349413 sequences. (Running on oeis4.)