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.

A082052 Sum of divisors of n that are not of the form 4k+1.

Original entry on oeis.org

0, 2, 3, 6, 0, 11, 7, 14, 3, 12, 11, 27, 0, 23, 18, 30, 0, 29, 19, 36, 10, 35, 23, 59, 0, 28, 30, 55, 0, 66, 31, 62, 14, 36, 42, 81, 0, 59, 42, 84, 0, 74, 43, 83, 18, 71, 47, 123, 7, 62, 54, 84, 0, 110, 66, 119, 22, 60, 59, 162, 0, 95, 73, 126, 0, 110, 67, 108, 26, 138, 71
Offset: 1

Views

Author

Ralf Stephan, Apr 02 2003

Keywords

Comments

a(A004613(n))=0.

Crossrefs

Programs

  • Mathematica
    sd[n_]:= Total[Select[Divisors[n], !IntegerQ[(# - 1) / 4]&]]; Array[sd, 100] (* Vincenzo Librandi, May 17 2013 *)
    Table[DivisorSum[n,#&,(!IntegerQ[(#-1)/4]&)],{n,80}] (* Harvey P. Dale, Nov 30 2019 *)
  • PARI
    for(n=1,100,print1(sumdiv(n,d,if(d%4!=1,d))","))

Formula

G.f.: Sum_{k>=1} x^(2*k)*(2 + 3*x^k + 4*x^(2*k) + 2*x^(4*k) + x^(5*k))/(1 - x^(4*k))^2. - Ilya Gutkovskiy, Sep 12 2019