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.

A064019 Numbers k such that sopf(k) = sopf(k^2 - 1), where sopf(k) = A008472(k).

This page as a plain text file.
%I A064019 #18 Jun 22 2018 04:24:37
%S A064019 1,5,51,99,155,209,2369,2569,2882,5745,15143,21691,34573,36566,40516,
%T A064019 41237,65304,82718,101638,112305,185701,238302,247221,254865,291399,
%U A064019 439104,445794,483107,532645,538531,570020,690238,698561,772485,805013
%N A064019 Numbers k such that sopf(k) = sopf(k^2 - 1), where sopf(k) = A008472(k).
%H A064019 Giovanni Resta, <a href="/A064019/b064019.txt">Table of n, a(n) for n = 1..1000</a> (first 100 terms from Harry J. Smith)
%o A064019 (PARI) sopf(n,s,fac,i)=fac=factor(n); for(i=1,matsize(fac)[1],s=s+fac[i,1]); return(s);
%o A064019 for(n=1,10^6, if(sopf(n)==sopf(n^2-1),print(n)))
%o A064019 (PARI) sopf(n)= { local(f,s=0); f=factor(n); for(i=1, matsize(f)[1], s+=f[i, 1]); return(s) }
%o A064019 { n=0; for (m=1, 10^9, if (sopf(m)==sopf(m^2 - 1), write("b064019.txt", n++, " ", m); if (n==100, break)) ) } \\ _Harry J. Smith_, Sep 06 2009
%K A064019 nonn
%O A064019 1,2
%A A064019 _Jason Earls_, Sep 07 2001
%E A064019 a(21)-a(35) from _Donovan Johnson_, Jun 15 2009