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.

A195051 Number of divisors of 24*n - 1.

Original entry on oeis.org

2, 2, 2, 4, 4, 4, 2, 2, 4, 2, 2, 4, 2, 4, 2, 2, 4, 2, 8, 2, 2, 4, 4, 6, 2, 4, 2, 4, 4, 2, 2, 4, 4, 4, 2, 2, 2, 2, 8, 4, 2, 4, 2, 4, 4, 2, 6, 2, 6, 4, 2, 4, 4, 8, 2, 4, 2, 4, 4, 2, 8, 2, 2, 4, 2, 2, 2, 4, 4, 4, 4, 4, 4, 6, 4, 2, 2, 2, 4, 4, 4, 4, 4, 8, 2, 2
Offset: 1

Views

Author

Omar E. Pol, Jan 13 2012

Keywords

Crossrefs

Programs

  • GAP
    List([1..100],n->Tau(24*n-1)); # Muniru A Asiru, Jun 27 2018
    
  • Maple
    seq(numtheory:-tau(24*n-1),n=1..100); # Robert Israel, Jun 27 2018
  • Mathematica
    Table[DivisorSigma[0, 24*n-1], {n, 100}] (* T. D. Noe, Jan 14 2012 *)
  • PARI
    a(n) = numdiv(24*n-1); \\ Amiram Eldar, Dec 22 2023

Formula

a(n) = A000005(A183010(n)).
a(n) = 2 * A195052(n).
Sum_{k=1..n} a(k) ~ (n/3) * (log(n) + 2*gamma - 1 + 5*log(2) + 2*log(3)), where gamma is Euler's constant (A001620). - Amiram Eldar, Dec 22 2023