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.

Showing 1-2 of 2 results.

A039956 Even squarefree numbers.

Original entry on oeis.org

2, 6, 10, 14, 22, 26, 30, 34, 38, 42, 46, 58, 62, 66, 70, 74, 78, 82, 86, 94, 102, 106, 110, 114, 118, 122, 130, 134, 138, 142, 146, 154, 158, 166, 170, 174, 178, 182, 186, 190, 194, 202, 206, 210, 214, 218, 222, 226, 230, 238, 246, 254, 258, 262
Offset: 1

Views

Author

Keywords

Comments

Sum of even divisors = 2 * the sum of odd divisors. - Amarnath Murthy, Sep 07 2002
From Daniel Forgues, May 27 2009: (Start)
a(n) = n * (3/1) * zeta(2) + O(n^(1/2)) = n * (3/1) * (Pi^2 / 6) + O(n^(1/2)).
For any prime p_i, the n-th squarefree number even to p_i (divisible by p_i) is:
n * ((p_i + 1)/1) * zeta(2) + O(n^(1/2)) = n * ((p_i + 1)/1) * (Pi^2 / 6) + O(n^(1/2)).
For any prime p_i, there are as many squarefree numbers having p_i as a factor as squarefree numbers not having p_i as a factor amongst all the squarefree numbers (one-to-one correspondence, both cardinality aleph_0).
E.g., there are as many even squarefree numbers as there are odd squarefree numbers.
For any prime p_i, the density of squarefree numbers having p_i as a factor is 1/p_i of the density of squarefree numbers not having p_i as a factor.
E.g., the density of even squarefree numbers is 1/p_i = 1/2 of the density of odd squarefree numbers (which means that 1/(p_i + 1) = 1/3 of the squarefree numbers are even and p_i/(p_i + 1) = 2/3 are odd) and as a consequence the n-th even squarefree number is very nearly p_i = 2 times the n-th odd squarefree number (which means that the n-th even squarefree number is very nearly (p_i + 1) = 3 times the n-th squarefree number while the n-th odd squarefree number is very nearly (p_i + 1)/ p_i = 3/2 the n-th squarefree number).
(End)
Apart from first term, these are the tau2-atoms as defined in [Anderson, Frazier] and [Lanterman]. - Michel Marcus, May 15 2019

References

  • Richard A. Mollin, Quadratics, CRC Press, 1996, Tables B1-B3.

Crossrefs

Programs

  • Haskell
    a039956 n = a039956_list !! (n-1)
    a039956_list = filter even a005117_list  -- Reinhard Zumkeller, Aug 15 2011
    
  • Magma
    [n: n in [2..262 by 2] | IsSquarefree(n)];  // Bruno Berselli, Mar 03 2011
    
  • Maple
    select(numtheory:-issqrfree,[seq(i,i=2..1000,4)]); # Robert Israel, Dec 23 2015
  • Mathematica
    Select[Range[2,270,2],SquareFreeQ] (* Harvey P. Dale, Jul 23 2011 *)
  • PARI
    is(n)=n%4==2 && issquarefree(n) \\ Charles R Greathouse IV, Sep 13 2013

Formula

Numbers k such that A092673(k) = +- 2. - Jon Perry, Mar 02 2004
Sum_{n>=1} 1/a(n)^s = zeta(s)/((1+2^s)*zeta(2*s)). - Enrique Pérez Herrero, Sep 15 2012 [corrected by Amiram Eldar, Sep 26 2023]
a(n) = 2*A056911(n). - Robert Israel, Dec 23 2015
a(n) = 2*(1+2*A264387(n)), n >= 1. - Wolfdieter Lang, Dec 24 2015

A120676 Number of prime factors of even squarefree numbers A039956.

Original entry on oeis.org

1, 2, 2, 2, 2, 2, 3, 2, 2, 3, 2, 2, 2, 3, 3, 2, 3, 2, 2, 2, 3, 2, 3, 3, 2, 2, 3, 2, 3, 2, 2, 3, 2, 2, 3, 3, 2, 3, 3, 3, 2, 2, 2, 4, 2, 2, 3, 2, 3, 3, 3, 2, 3, 2, 3, 2, 2, 3, 3, 3, 2, 2, 3, 2, 3, 3, 2, 4, 2, 2, 3, 2, 2, 3, 3, 3, 2, 2, 4, 2, 2, 3, 3, 3, 3, 2, 3, 3, 3, 3, 3, 2, 2, 2, 4, 2, 3, 3, 2, 2, 3, 3, 2, 3, 4
Offset: 1

Views

Author

Lekraj Beedassy, Jun 24 2006

Keywords

Programs

  • Maple
    issquarefree := proc(n::integer) local nf, ifa ; nf := op(2,ifactors(n)) ; for ifa from 1 to nops(nf) do if op(2,op(ifa,nf)) >= 2 then RETURN(false) ; fi ; od : RETURN(true) ; end: A001221 := proc(n::integer) RETURN(nops(numtheory[factorset](n))) ; end: A039956 := proc(maxn) local n,a ; a := [2] ; for n from 4 to maxn by 2 do if issquarefree(n) then a := [op(a),n] ; fi ; od : RETURN(a) ; end: A120676 := proc(maxn) local a,n; a := A039956(maxn) ; for n from 1 to nops(a) do a := subsop(n=A001221(a[n]),a) ; od ; RETURN(a) ; end: nmax := 600 : a := A120676(nmax) : for n from 1 to nops(a) do printf("%d,",a[n]) ; od ; # R. J. Mathar, Aug 17 2006
  • Mathematica
    A264387[n_] := (# - 2)/4 & /@ Select[2 Range@n, SquareFreeQ]; A039956[n_] := 2*(1 + 2*A264387[n]); PrimeNu[A039956[50]] (* G. C. Greubel, May 16 2017 *)
    PrimeOmega/@Select[2*Range[300],SquareFreeQ] (* Harvey P. Dale, Jul 28 2019 *)

Formula

a(n) = A001221(A039956(n)) = A001222(A039956(n)) = A120675(n)+1.

Extensions

Corrected and extended by R. J. Mathar, Aug 17 2006
Showing 1-2 of 2 results.