[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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, 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
OFFSET
1,2
COMMENTS
Odd terms: 1, 45, 405, 1617, 2505, 3645, 5215, 14427, 20745, 24345, 28287, 32475, 40005, 41625, 44145, 46697, 63525, 76185, 78435, 82995, 93645, ..., . - Robert G. Wilson v
MATHEMATICA
a = {1}; Do[i = a[[ -1]] + 1; While[Mod[i, Length[Divisors[a[[ -1]]]]] > 0, i++ ]; AppendTo[a, i], {60}]; a (* Stefan Steinerberger, 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] (* Robert G. Wilson v *)
CROSSREFS
Sequence in context: A284005 A079212 A354768 * A292854 A330813 A015897
KEYWORD
nonn
AUTHOR
Leroy Quet, Aug 07 2008
EXTENSIONS
More terms from Robert G. Wilson v, Aug 18 2008 and Stefan Steinerberger, Aug 28 2008
STATUS
approved