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.

A064465 Numbers k such that A048138(k) = A034444(k).

This page as a plain text file.
%I A064465 #16 Jun 24 2018 09:01:27
%S A064465 5,7,13,16,19,31,36,40,41,43,49,50,53,61,74,82,84,89,92,94,102,103,
%T A064465 107,109,113,130,138,140,149,151,154,158,169,181,182,197,199,217,229,
%U A064465 233,239,241,243,257,266,271,293,331,349,361,383,389,409,419,421,439,463
%N A064465 Numbers k such that A048138(k) = A034444(k).
%H A064465 Harry J. Smith, <a href="/A064465/b064465.txt">Table of n, a(n) for n = 1..100</a>
%o A064465 (PARI) f(n) = s=0; for(x=1,n^2, if(sigma(x)-x-1==n,s++)); s ud(n) = 2^omega(n); j=[]; for(n=1,150, if(f(n)==ud(n),j=concat(j,n))); j
%o A064465 (PARI) f(n)= { local(s=0); for(x=1, n^2, if(sigma(x) - x - 1==n, s++)); return(s) } ud(n)= { 2^omega(n) } { n=0; for (m=1, 10^9, if (f(m)==ud(m), write("b064465.txt", n++, " ", m); if (n==100, break)) ) } \\ _Harry J. Smith_, Sep 15 2009
%Y A064465 Cf. A034444, A048138.
%K A064465 easy,nonn
%O A064465 1,1
%A A064465 _Jason Earls_, Oct 03 2001
%E A064465 More terms from _Klaus Brockhaus_, Oct 03 2001