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.

A053734 A000016-A000048 (when they are lined up so that the two 16's match).

Original entry on oeis.org

0, 0, 1, 0, 1, 1, 1, 0, 2, 1, 1, 2, 1, 1, 5, 0, 1, 6, 1, 2, 11, 1, 1, 16, 4, 1, 30, 2, 1, 57, 1, 0, 95, 1, 13, 172, 1, 1, 317, 16, 1, 591, 1, 2, 1124, 1, 1, 2048, 10, 52, 3857, 2, 1, 7286, 97, 16, 13799, 1, 1, 26386, 1, 1, 49968, 0, 319, 95331, 1, 2, 182363
Offset: 1

Views

Author

N. J. A. Sloane, Mar 25 2000

Keywords

Programs

  • Maple
    f := proc(n) local d,sum1; sum1 := 0; for d from 1 to n do if d mod 2 = 1 and n mod d = 0 then sum1 := sum1+(phi(d)-mobius(d))*2^(n/d); fi; od; sum1/(2*n); end;
  • Mathematica
    Table[DivisorSum[n, Mod[#, 2] EulerPhi[#]*2^(n/#)/(2 n) &] - DivisorSum[n, Total[MoebiusMu[#]*2^(n/#)]/(2 n) &, OddQ], {n, 69}] (* Michael De Vlieger, Mar 26 2022 *)