A129265 Triangle read by rows: T(n,k) is the number of power of two divisors of n that are less than or equal to n/k.
1, 2, 1, 1, 1, 1, 3, 2, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1
Offset: 1
Examples
First few rows of the triangle are: 1; 2, 1; 1, 1, 1; 3, 2, 1, 1; 1, 1, 1, 1, 1; 2, 2, 2, 1, 1, 1; 1, 1, 1, 1, 1, 1, 1; ...
Links
- Andrew Howroyd, Table of n, a(n) for n = 1..1275
Programs
-
PARI
T(n, k)={sumdiv(n, d, d <= n/k && d==1<
Andrew Howroyd, Aug 07 2018
Formula
T(n,k) = 1 for n odd.
Extensions
Name changed and terms a(56) and beyond from Andrew Howroyd, Aug 07 2018
Comments