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.

A001817 G.f.: Sum_{n>0} x^n/(1-x^(3n)) = Sum_{n>=0} x^(3n+1)/(1-x^(3n+1)).

Original entry on oeis.org

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

Views

Author

Keywords

Comments

a(n) is the number of positive divisors of n of the form 3k+1. If r(n) denotes the number of representations of n by the quadratic form j^2+ij+i^2, then r(n)= 6 *(a(n)-A001822(n)). - Benoit Cloitre, Jun 24 2002

Examples

			x + x^2 + x^3 + 2*x^4 + x^5 + x^6 + 2*x^7 + 2*x^8 + x^9 + ...
		

References

  • Bruce C. Berndt, On a certain theta-function in a letter of Ramanujan from Fitzroy House, Ganita 43 (1992), 33-43.

Crossrefs

Programs

  • Haskell
    a001817 n = length [d | d <- [1,4..n], mod n d == 0]
    -- Reinhard Zumkeller, Nov 26 2011
  • Maple
    A001817 := proc(n)
        local a,d ;
        a := 0 ;
        for d in numtheory[divisors](n) do
            if modp(d,3) = 1 then
                a := a+1 ;
            end if ;
        end do:
        a ;
    end proc:
    seq(A001817(n),n=1..100) ; # R. J. Mathar, Sep 25 2017
  • Mathematica
    a[n_] := DivisorSum[n, Boole[Mod[#, 3] == 1]&]; Array[a, 100] (* Jean-François Alcover, Dec 01 2015 *)
  • PARI
    a(n)=if(n<1,0,sumdiv(n,d,d%3==1))
    

Formula

Moebius transform is period 3 sequence [1, 0, 0, ...]. - Michael Somos, Sep 20 2005
G.f.: Sum_{k>0} x^(3k-2)/(1-x^(3k-2)) = Sum_{k>0} x^k/(1-x^(3k)). - Michael Somos, Sep 20 2005
Equals A051731 * [1, 0, 0, 1, 0, 0, 1, 0, 0, 1, ...]. - Gary W. Adamson, Nov 06 2007
a(n) = (A035191(n) + A002324(n)) / 2. - Reinhard Zumkeller, Nov 26 2011
Sum_{k=1..n} a(k) = n*log(n)/3 + c*n + O(n^(1/3)*log(n)), where c = gamma(1,3) - (1 - gamma)/3 = A256425 - (1 - A001620)/3 = 0.536879... (Smith and Subbarao, 1981). - Amiram Eldar, Nov 25 2023