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-1 of 1 results.

A074226 Numbers n such that Kronecker(3,n) = 1.

Original entry on oeis.org

1, 4, 10, 11, 13, 14, 16, 23, 25, 34, 35, 37, 38, 40, 44, 47, 49, 52, 56, 58, 59, 61, 62, 64, 71, 73, 82, 83, 85, 86, 92, 95, 97, 100, 106, 107, 109, 110, 119, 121, 130, 131, 133, 134, 136, 140, 143, 145, 148, 152, 154, 155, 157, 158, 160, 167, 169, 176, 178, 179
Offset: 1

Views

Author

Jon Perry, Sep 17 2002

Keywords

Comments

Numbers n such that Kronecker(3, n) = mu(gcd(n, 3)).

Crossrefs

Programs

  • Mathematica
    Select[Range@ 180, KroneckerSymbol[3, #]== 1 &]  (* Indranil Ghosh, Mar 16 2017 *)
  • PARI
    for (x=1,200, for (y=1,200,if (kronecker(x,y)==moebius(gcd(x,y)),write("km.txt",x,";",y," : ",kronecker(x,y)))))
    
  • PARI
    is(n)=kronecker(3,n)>0 \\ Charles R Greathouse IV, Apr 06 2012

Formula

a(n) seems to be asymptotic to c*n with c=3. - Benoit Cloitre, Sep 18 2002

Extensions

Definition simplified by Charles R Greathouse IV, Apr 06 2012
Offset changed by Sean A. Irvine, Jan 14 2025
Showing 1-1 of 1 results.