The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A144913 Integers which are the product of even powers of primes up to 13. 1

%I #17 Dec 26 2021 15:32:40

%S 4,9,16,25,36,49,64,81,100,121,144,169,196,225,256,324,400,441,484,

%T 576,625,676,729,784,900,1024,1089,1225,1296,1521,1600,1764,1936,2025,

%U 2304,2401,2500,2704,2916,3025,3136,3600,3969,4096,4225,4356,4900,5184,5625

%N Integers which are the product of even powers of primes up to 13.

%H Charles R Greathouse IV, <a href="/A144913/b144913.txt">Table of n, a(n) for n = 1..10000</a>

%F a(n) = A080197(n+1)^2. - _Rémy Sigrist_, Sep 26 2020

%F Sum_{n>=1} 1/a(n) = -1 + Product_{primes p <= 13} p^2/(p^2-1) = 273347/442368. - _Amiram Eldar_, Oct 14 2020

%t Select[ Range[75]^2, (fi = FactorInteger[#]; Max[ fi[[All, 1]] ] <= 13 && And @@ EvenQ /@ fi[[All, 2]]) &] (* _Jean-François Alcover_, Oct 10 2012 *)

%t eppQ[n_]:=Module[{fi=FactorInteger[n]},Max[fi[[All,1]]]<=13&&AllTrue[ fi[[All,2]],EvenQ]]; Select[Range[6000],eppQ] (* _Harvey P. Dale_, Dec 26 2021 *)

%o (PARI) is(n)=if(issquare(n,&n), my(f=factor(n)[,1]); #f && f[#f]<14, 0) \\ _Charles R Greathouse IV_, Jun 17 2013

%Y Subsequence of A000290 and A080197.

%Y Cf. A001694.

%K easy,nice,nonn

%O 1,1

%A _Reikku Kulon_, Sep 25 2008, Sep 26 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 13 17:28 EDT 2024. Contains 372522 sequences. (Running on oeis4.)