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.

A064125 Numbers k such that k and k+1 have the same sum of unitary divisors (A034448).

This page as a plain text file.
%I A064125 #19 Jun 22 2018 07:12:25
%S A064125 14,44,55,152,957,1334,1400,1634,1652,2204,2232,2295,2685,3195,3451,
%T A064125 3956,4256,5547,7191,8216,8495,8636,8907,9144,9503,9844,10152,11515,
%U A064125 17255,18423,19491,20145,20155,27404,27643,30247,33998,38180,41265
%N A064125 Numbers k such that k and k+1 have the same sum of unitary divisors (A034448).
%H A064125 Giovanni Resta, <a href="/A064125/b064125.txt">Table of n, a(n) for n = 1..10000</a> (first 800 terms from Harry J. Smith)
%o A064125 (PARI) usigma(n,s=1,fac,i)=fac=factor(n); for(i=1,matsize(fac)[1], s=s*(1+fac[i,1]^fac[i,2])); return(s); j=[]; for(n=1,50000, if(usigma(n)==usigma(n+1),j=concat(j,n))); j
%o A064125 (PARI) usigma(n)= { local(f,s=1); f=factor(n); for(i=1, matsize(f)[1], s*=1 + f[i, 1]^f[i, 2]); return(s) }
%o A064125 { n=0; s=0; for (m=1, 10^9, us=usigma(m+1); if(s==us, write("b064125.txt", n++, " ", m); if (n==800, break)); s=us ) } \\ _Harry J. Smith_, Sep 08 2009
%K A064125 easy,nonn
%O A064125 1,1
%A A064125 _Jason Earls_, Sep 10 2001