cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A129636 Triangle T(n,k): base-3 digit sum of the Pascal type triangle A102363(n,k).

Original entry on oeis.org

1, 2, 1, 2, 3, 3, 4, 1, 2, 3, 4, 5, 3, 1, 3, 4, 3, 4, 4, 4, 3, 4, 5, 7, 4, 6, 5, 5, 6, 5, 4, 7, 4, 7, 4, 3, 4, 5, 5, 7, 7, 7, 9, 7, 7, 8, 3, 4, 6, 8, 4, 4, 4, 6, 7, 8, 9, 5, 4, 8, 8, 8, 6, 8, 7, 9, 10, 9, 10, 7, 4, 6, 8, 10, 8
Offset: 0

Views

Author

David G. Williams (davidwilliams(AT)paxway.com), Jun 09 2007

Keywords

Examples

			..............1......................1........................1
.............2.3....................2.10.....................2.1
............4.5.7.................11.12.21..................2.3.3
...........8.9.12.15............22.100.110.120.............4.1.2.3
		

Crossrefs

Cf. A102363.

Programs

  • Maple
    A053735 := proc(n) add(d,d=convert(n,base,3)) ; end proc:
    A102363 := proc(n,k) if k=0 then 2^n elif k=n then 2^(n+1)-1 else procname(n-1, k)+procname(n-1, k-1) end if; end proc:
    A129636 := proc(n,k) A053735(A102363(n,k)) ; end proc: # R. J. Mathar, Sep 09 2011

Formula

a(n) = A053735(A102363(n,k)). - R. J. Mathar, Sep 09 2011

Extensions

Corrected by R. J. Mathar, Sep 09 2011