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!)
A367055 Triangle read by rows: T(n, k) = A000120(n) + A000120(k), 0 <= k <= n. 1
0, 1, 2, 1, 2, 2, 2, 3, 3, 4, 1, 2, 2, 3, 2, 2, 3, 3, 4, 3, 4, 2, 3, 3, 4, 3, 4, 4, 3, 4, 4, 5, 4, 5, 5, 6, 1, 2, 2, 3, 2, 3, 3, 4, 2, 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 2, 3, 3, 4, 3, 4, 4, 5, 3 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
T(n, k) is the sum of the Hamming weight of n and the Hamming weight of k.
See A365618 for a table read by antidiagonals.
LINKS
FORMULA
T(n, k) = A000120(n) + A000120(k).
EXAMPLE
Triangle begins:
k=0 1 2 3 4 5
n=0: 0;
n=1: 1, 2;
n=2: 1, 2, 2;
n=3: 2, 3, 3, 4;
n=4: 1, 2, 2, 3, 2;
n=5: 2, 3, 3, 4, 3, 4;
...
MATHEMATICA
T[n_, k_] := DigitCount[n, 2, 1] + DigitCount[k, 2, 1]
CROSSREFS
Sequence in context: A025800 A029258 A280128 * A354703 A070096 A319821
KEYWORD
nonn,easy,tabl
AUTHOR
Mithra Karamchedu and Sophia Pi, Nov 03 2023
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 September 17 21:55 EDT 2024. Contains 375990 sequences. (Running on oeis4.)