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”).

A177268
a(n) = the smallest positive integer not yet occurring such that the number of divisors of 1+sum{k=1 to n} a(k) is exactly n.
1
1, 2, 4, 8, 12, 36, 6, 30, 62, 862, 11, 3061, 4096, 8192, 17, 49135, 60, 196548, 48, 977, 6143, 3924992, 21, 283131, 15856, 5329, 111, 263936704, 1744, 805304624, 10, 14730230, 670720, 18082841, 50, 67612251061, 786432, 99913728, 80
OFFSET
2,2
COMMENTS
It seems possible that this is a permutation of the positive integers. Is it?
This is analogous to A175350(n) with a(1)=a(2)=1.
1 + sum{k=1 to n} a(k) = A177269(n).
CROSSREFS
KEYWORD
nonn
AUTHOR
Hugo van der Sanden, May 06 2010
STATUS
approved