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.
%I A376874 #12 Oct 29 2024 08:17:29 %S A376874 6,20,28,88,104,272,304,550,650,368,464,496,1184,1312,1376,1504,1696, %T A376874 1888,1952,11132,4288,4544,4672,5056,5312,5696,6208,6464,6592,6848, %U A376874 6976,7232,8128,16768,17536,17792,19072,19328,20096,20864,21376,22144,22912,23168,24448 %N A376874 a(n) = A376877(n) / p where p is the largest prime factor of A376877(n). %C A376874 Apparently a subset of A006039 and of A180332. %C A376874 It seems that the terms are abundant numbers unless p is a Mersenne prime; in that case they are perfect numbers (unproved). %C A376874 Terms a(1)-a(59) are each divisible by the corresponding p, and many of those quotients are powers of 2. %H A376874 Peter Luschny and Michael S. Branicky, <a href="/A376874/b376874.txt">Table of n, a(n) for n = 1..59</a> %p A376874 a := proc(n) A376877(n); % / max(NumberTheory:-PrimeFactors(%)) end: %p A376874 seq(a(n), n = 1..45); %Y A376874 Cf. A376877, A006039, A180332, A023196, A083207. %K A376874 nonn %O A376874 1,1 %A A376874 _Peter Luschny_ and _Michael S. Branicky_, Oct 27 2024