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.

A229895 k-tuple sizes in A229873.

Original entry on oeis.org

1, 1, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4
Offset: 1

Views

Author

Carl R. White, Oct 03 2013

Keywords

Comments

Number k of elements to read from A229873 to obtain the next k-tuple.

Examples

			The sequence of tuples represented in A229873 begins (1), (2), (1,1), (1,2), (2,1), (2,2), (3), so this sequence begins 1, 1, 2, 2, 2, 2, 1.
		

Crossrefs

Programs

  • bc
    /* GNU bc */ for(n=1;n<=5;n++)for(k=1;k<=n;k++){if(k==n){t=n^n}else{t=n^k-(n-1)^k};for(i=1;i<=t;i++) print k,","};print "...\n"