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.

A102354 a(n) is the number of ways n can be written as k^2 * j, 0 < j <= k.

Original entry on oeis.org

1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 2, 0, 0, 0, 0, 0
Offset: 1

Views

Author

Leroy Quet, Feb 21 2005

Keywords

Comments

Sum_{n>0} a(n)/n = 2*zeta(3). See A152648.

Examples

			a(18) = 1 because 18 = k^2 * j, j <= k, in one way: k=3, j=2.
		

Crossrefs

Programs

  • Mathematica
    t = Sort[ Flatten[ Table[k^2*j, {k, 11}, {j, k}]]]; Table[ Count[t, n], {n, 105}] (* Robert G. Wilson v, Feb 22 2005 *)
  • PARI
    A102354(n) = sumdiv(n,d,(issquare(d) && (sqrtint(d) >= (n/d)))); \\ Antti Karttunen, Aug 27 2017

Formula

a(n) >= A102448(n). - Antti Karttunen, Aug 27 2017

Extensions

More terms from Robert G. Wilson v, Feb 22 2005