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.

A326132 Numbers n for which A294898(n) is not zero and A294898(n) divides A000120(n); numbers for which A326130(n) = abs(A294898(n)).

This page as a plain text file.
%I A326132 #11 Jun 13 2019 12:52:41
%S A326132 5,6,7,14,15,28,44,52,110,152,184,496,592,884,1012,1155,2144,2272,
%T A326132 8128,8384,12008,18632,18904,33664,63248,70564,85936,100804,116624,
%U A326132 318250,527872,1090912,1360810,1503370,1788490,2085710,2102272,3477608,4495808,8394752,15370304,16102808,26347688,29322008,33550336,73995392
%N A326132 Numbers n for which A294898(n) is not zero and A294898(n) divides A000120(n); numbers for which A326130(n) = abs(A294898(n)).
%H A326132 Antti Karttunen, <a href="/A326132/b326132.txt">Table of n, a(n) for n = 1..52; all terms < 2^31</a>
%H A326132 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%H A326132 <a href="/index/O#opnseqs">Index entries for sequences where any odd perfect numbers must occur</a>
%H A326132 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>
%o A326132 (PARI)
%o A326132 A005187(n) = { my(s=n); while(n>>=1, s+=n); s; };
%o A326132 isA326132(n) = { my(t=sigma(n)-A005187(n)); (gcd(hammingweight(n), t) == abs(t)); };
%Y A326132 Cf. A000360, A326131 (subsequences), A326133.
%Y A326132 Cf. A000120, A000203, A005187, A294898, A295296.
%K A326132 nonn
%O A326132 1,1
%A A326132 _Antti Karttunen_, Jun 11 2019