A376820 The smallest abundant number that begins a run of at least n consecutive abundant numbers with the same number of divisors.

12, 12, 12, 340, 340, 733332, 8547188, 1162009926, 11074811524, 11074811524, 2164181867010

Offset

1,1

Links

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

Lucas A. Brown, Python program.

Example

a(6) = 733332 because 733332 is the smallest abundant number that begins a run of 6 consecutive abundant numbers (733332, 733338, 733340, 733344, 733348, 733350) with the same number of divisors, i.e. 24.
a(7) = 8547188 because 8547188 is the smallest abundant number that begins a run of 7 consecutive abundant numbers (8547188, 8547192, 8547196, 8547198, 8547200, 8547204, 8547210) with the same number of divisors, i.e. 48.

Crossrefs

Cf. A000005, A005101.

Sequence in context: A134324 A268914 A056627 * A376819 A334620 A061074

Adjacent sequences: A376817 A376818 A376819 * A376821 A376822 A376823

Keyword

nonn,more,hard,changed

Author

Shyam Sunder Gupta, Oct 05 2024

Extensions

a(11) from Lucas A. Brown, Nov 12 2024

Status

approved