|
Search: id:A141452
|
|
|
| A141452 |
|
a(1)=1. a(n) = the smallest integer > a(n-1) that is divisible by the number of divisors of a(n-1). |
|
+0
1
|
|
| 1, 2, 4, 6, 8, 12, 18, 24, 32, 36, 45, 48, 50, 54, 56, 64, 70, 72, 84, 96, 108, 120, 128, 136, 144, 150, 156, 168, 176, 180, 198, 204, 216, 224, 228, 240, 260, 264, 272, 280, 288, 306, 312, 320, 322, 328, 336, 340, 348, 360, 384, 400, 405, 410, 416, 420, 432, 440
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Odd terms: 1, 45, 405, 1617, 2505, 3645, 5215, 14427, 20745, 24345, 28287, 32475, 40005, 41625, 44145, 46697, 63525, 76185, 78435, 82995, 93645, ..., . - RGWv.
|
|
LINKS
|
Leroy Quet, Home Page (listed in lieu of email address)
|
|
MATHEMATICA
|
a = {1}; Do[i = a[[ -1]] + 1; While[Mod[i, Length[Divisors[a[[ -1]]]]] > 0, i++ ]; AppendTo[a, i], {60}]; a [From Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Aug 28 2008]
a[1] = 1; a[n_] := a[n] = Block[{k = a[n - 1] + 1, d = DivisorSigma[0, a[n - 1]]}, While[ Mod[k, d] != 0, k++ ]; k]; Array[a, 58] (* RGWv *)
|
|
CROSSREFS
|
Sequence in context: A096903 A032458 A079212 this_sequence A050597 A057335 A126907
Adjacent sequences: A141449 A141450 A141451 this_sequence A141453 A141454 A141455
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Leroy Quet Aug 07 2008
|
|
EXTENSIONS
|
More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Aug 18 2008 and Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Aug 28 2008
|
|
|
Search completed in 0.002 seconds
|
