cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A376874 a(n) = A376877(n) / p where p is the largest prime factor of A376877(n).

Original entry on oeis.org

6, 20, 28, 88, 104, 272, 304, 550, 650, 368, 464, 496, 1184, 1312, 1376, 1504, 1696, 1888, 1952, 11132, 4288, 4544, 4672, 5056, 5312, 5696, 6208, 6464, 6592, 6848, 6976, 7232, 8128, 16768, 17536, 17792, 19072, 19328, 20096, 20864, 21376, 22144, 22912, 23168, 24448
Offset: 1

Views

Author

Keywords

Comments

Apparently a subset of A006039 and of A180332.
It seems that the terms are abundant numbers unless p is a Mersenne prime; in that case they are perfect numbers (unproved).
Terms a(1)-a(59) are each divisible by the corresponding p, and many of those quotients are powers of 2.

Crossrefs

Programs

  • Maple
    a := proc(n) A376877(n); % / max(NumberTheory:-PrimeFactors(%)) end:
    seq(a(n), n = 1..45);