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.

A335328 Number k such that both k and k+1 have an equal number of unitary and nonunitary divisors.

This page as a plain text file.
%I A335328 #22 Jun 05 2020 12:47:44
%S A335328 135,296,343,375,1160,1431,1592,1624,2295,2456,2727,3429,3591,3624,
%T A335328 3752,3992,4023,4184,4887,4913,5048,5144,5319,5480,6183,6344,6375,
%U A335328 6858,7479,7624,7640,7749,7911,8072,8375,8936,9207,9368,9624,10071,10232,10375,10503,10632
%N A335328 Number k such that both k and k+1 have an equal number of unitary and nonunitary divisors.
%C A335328 Terms k such that k+1 is also in this sequence are 22625, 28375, 40472, ...
%H A335328 Amiram Eldar, <a href="/A335328/b335328.txt">Table of n, a(n) for n = 1..10000</a>
%F A335328 Numbers n such that both n and n+1 are of the form p^3 * q * r * s * ... where p, q, r, ... are distinct primes (with zero or more primes q, r, s, ...). - _Charles R Greathouse IV_, Jun 05 2020
%e A335328 135 is a term since both 135 and 136 have 4 unitary divisors and 4 nonunitary divisors.
%t A335328 seqQ[n_] := DivisorSigma[0, n] == 2^(PrimeNu[n] + 1); q1 = seqQ[1]; s = {}; Do[q2 = seqQ[n]; If[q1 && q2, AppendTo[s, n-1]]; q1 = q2, {n, 2, 10^4}]; s
%Y A335328 Subsequence of A048109 and A000037.
%Y A335328 Cf. A000005, A034444, A048105.
%K A335328 nonn
%O A335328 1,1
%A A335328 _Amiram Eldar_, Jun 01 2020