|
Search: id:A134488
|
|
|
| A134488 |
|
a(0)=1. a(n) = n + d(a(n-1)), where d(m) is the number of positive divisors of m. |
|
+0
1
|
|
| 1, 2, 4, 6, 8, 9, 9, 10, 12, 15, 14, 15, 16, 18, 20, 21, 20, 23, 20, 25, 23, 23, 24, 31, 26, 29, 28, 33, 32, 35, 34, 35, 36, 42, 42, 43, 38, 41, 40, 47, 42, 49, 45, 49, 47, 47, 48, 57, 52, 55, 54, 59, 54, 61, 56, 63, 62, 61, 60, 71, 62, 65, 66, 71, 66, 73, 68, 73, 70, 77, 74
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Giving the sequence an offset of 1 instead, and letting a(1)=1, we get the sequence beginning: 1,3,5,6,9,9,10,12,15,14,15,16,18,20,... This is the same as sequence A134488 for every term from a(5) on.
|
|
LINKS
|
Leroy Quet, Home Page (listed in lieu of email address)
|
|
EXAMPLE
|
a(10)=14 because a(9) (=15) has 4 positive divisors (1,3,5,15) and then a(10)=10+4=14.
|
|
MAPLE
|
with(numtheory): a[0]:=1: for n to 60 do a[n]:=n+tau(a[n-1]) end do: seq(a[n], n=0..60); - Emeric Deutsch (deutsch(AT)duke.poly.edu), Nov 12 2007
|
|
MATHEMATICA
|
a = {1}; Do[AppendTo[a, Length[a] + Length[Divisors[a[[ -1]]]]], {70}]; a - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Oct 30 2007
|
|
CROSSREFS
|
Adjacent sequences: A134485 A134486 A134487 this_sequence A134489 A134490 A134491
Sequence in context: A062355 A087671 A088308 this_sequence A085492 A065090 A003254
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Leroy Quet Oct 28 2007
|
|
EXTENSIONS
|
More terms from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Oct 30 2007
|
|
|
Search completed in 0.002 seconds
|
