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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A083651 Triangular array, read by rows: T(n,k) = k-th bit in binary representation of n (0<=k<=n). 3
 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS n = Sum(T(n,k)*2^k: 0<=k<=n); T(n, A070939(n))=1 for n>0, T(n,k)=0 for k>A070939(n); T(n,0)=A000035(n); T(n,n)=0; A021913(0)=T(0,0), A021913(n)=T(n,1) for n>0. LINKS EXAMPLE The triangle starts 0 1 0 0 1 0 1 1 0 0 0 0 1 0 0 1 0 1 0 0 0 0 1 1 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 1 1 0 1 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 1 0 1 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 MAPLE A083651 := proc(n, k)     floor(n/2^k) ;     modp(%, 2) ; end proc:  # R. J. Mathar, Apr 21 2021 MATHEMATICA row[n_] := row[n] = PadRight[Reverse[IntegerDigits[n, 2]], n+1]; T[n_, k_] := row[n][[k+1]]; Table[T[n, k], {n, 0, 14}, {k, 0, n}] // Flatten CROSSREFS Cf. A000035 (column k=0), A133872 (k=1), A131078 (k=2), A000120 (row sums). Sequence in context: A189572 A287028 A327202 * A111748 A282244 A286691 Adjacent sequences:  A083648 A083649 A083650 * A083652 A083653 A083654 KEYWORD nonn,tabl,easy AUTHOR Reinhard Zumkeller, May 01 2003 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.

Last modified May 17 19:51 EDT 2022. Contains 353778 sequences. (Running on oeis4.)