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.

This page as a plain text file.
%I A102354 #20 Aug 27 2017 12:55:14
%S A102354 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,
%T A102354 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,
%U A102354 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
%N A102354 a(n) is the number of ways n can be written as k^2 * j, 0 < j <= k.
%C A102354 Sum_{n>0} a(n)/n = 2*zeta(3). See A152648.
%H A102354 Antti Karttunen, <a href="/A102354/b102354.txt">Table of n, a(n) for n = 1..65537</a>
%F A102354 a(n) >= A102448(n). - _Antti Karttunen_, Aug 27 2017
%e A102354 a(18) = 1 because 18 = k^2 * j, j <= k, in one way: k=3, j=2.
%t A102354 t = Sort[ Flatten[ Table[k^2*j, {k, 11}, {j, k}]]]; Table[ Count[t, n], {n, 105}] (* _Robert G. Wilson v_, Feb 22 2005 *)
%o A102354 (PARI) A102354(n) = sumdiv(n,d,(issquare(d) && (sqrtint(d) >= (n/d)))); \\ _Antti Karttunen_, Aug 27 2017
%Y A102354 Cf. A102448, A104020, A104022, A104024, A152648.
%K A102354 nonn
%O A102354 1,64
%A A102354 _Leroy Quet_, Feb 21 2005
%E A102354 More terms from _Robert G. Wilson v_, Feb 22 2005