login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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
Equals A115361 * A000012 as infinite lower triangular matrices (cf. A129264).
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
Row sums are A129527.
Column 1 is A001511.
Sequence in context: A334055 A365838 A254613 * A030358 A118914 A135063
KEYWORD
nonn,tabl
AUTHOR
Gary W. Adamson, Apr 06 2007
EXTENSIONS
Name changed and terms a(56) and beyond from Andrew Howroyd, Aug 07 2018
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 04:35 EDT 2024. Contains 371782 sequences. (Running on oeis4.)