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.

A365810 Squareferee numbers ordered factorization-wise by Blue code: a(n) = A019565(A193231(n)).

This page as a plain text file.
%I A365810 #12 Oct 06 2023 14:14:30
%S A365810 1,2,6,3,10,5,15,30,210,105,35,70,21,42,14,7,22,11,33,66,55,110,330,
%T A365810 165,1155,2310,770,385,462,231,77,154,858,429,143,286,2145,4290,1430,
%U A365810 715,5005,10010,30030,15015,2002,1001,3003,6006,39,78,26,13,390,195,65,130,910,455,1365,2730,91,182,546,273,1870,935
%N A365810 Squareferee numbers ordered factorization-wise by Blue code: a(n) = A019565(A193231(n)).
%H A365810 Antti Karttunen, <a href="/A365810/b365810.txt">Table of n, a(n) for n = 0..16383</a>
%H A365810 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%F A365810 a(n) = A334205(A019565(n)).
%o A365810 (PARI)
%o A365810 A019565(n) = { my(m=1, p=1); while(n>0, p = nextprime(1+p); if(n%2, m *= p); n >>= 1); (m); };
%o A365810 A193231(n) = { my(x='x); subst(lift(Mod(1, 2)*subst(Pol(binary(n), x), x, 1+x)), x, 2) };
%o A365810 A365810(n) = A019565(A193231(n));
%Y A365810 Permutation of A005117.
%Y A365810 Cf. A019565, A193231, A293231, A293443, A334205.
%Y A365810 Cf. also A366263.
%K A365810 nonn
%O A365810 0,2
%A A365810 _Antti Karttunen_, Oct 06 2023