|
|
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.
|
|
3
|
|
|
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
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
T(n,k) = 1 for n odd.
|
|
EXAMPLE
|
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;
...
|
|
PROG
|
(PARI) T(n, k)={sumdiv(n, d, d <= n/k && d==1<<valuation(d, 2))} \\ Andrew Howroyd, Aug 07 2018
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
EXTENSIONS
|
Name changed and terms a(56) and beyond from Andrew Howroyd, Aug 07 2018
|
|
STATUS
|
approved
|
|
|
|