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.

A275217 Even numbers n such that A000005(n) divides A000005(n^n).

This page as a plain text file.
%I A275217 #12 Jul 20 2016 10:33:12
%S A275217 4,16,64,100,196,484,676,1024,1156,1296,1444,1936,2116,3364,3844,4096,
%T A275217 4900,5476,5776,6400,6724,7396,8836,10816,11236,12100,13456,13924,
%U A275217 14884,15376,16900,17956,20164,21316,23716,24964,26896,27556,28900,31684,33124,36100
%N A275217 Even numbers n such that A000005(n) divides A000005(n^n).
%C A275217 This sequence is not the duplicate of A275123. See also comments section of A275123.
%C A275217 An even number n with prime factorization Product_i p_i^(e_i) is in this sequence iff Product_i (n*e_i+1)/(e_i+1) is an integer.
%C A275217 This sequence is infinite since A002110(n)^2 / 9 is always a term of this sequence for n > 1.
%H A275217 Charles R Greathouse IV, <a href="/A275217/b275217.txt">Table of n, a(n) for n = 1..10000</a>
%e A275217 4 is a term because 4 = 2^2 and (4*2+1) mod (2+1) = 0.
%o A275217 (PARI) is(n,f=factor(n))=f=f[,2]; n%2==0 && denominator(prod(i=1,#f,(f[i]*n+1)/(f[i]+1)))==1 \\ _Charles R Greathouse IV_, Jul 20 2016
%Y A275217 Cf. A000005, A062319, A275123.
%K A275217 nonn
%O A275217 1,1
%A A275217 _Altug Alkan_, Jul 20 2016