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.

A199570 Table, each row contains the previous sequence in odd columns and the row number in even columns.

Original entry on oeis.org

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

Views

Author

Keywords

Examples

			The table starts:
  1
  1 2
  1 3 1 3 2 3
  1 4 1 4 2 4 1 4 3 4 1 4 3 4 2 4 3 4
  ...
		

Crossrefs

Cf. A025192 (row lengths), A070940.

Programs

  • PARI
    n=4;v=vector(3^n);v[1]=1;for(k=1,n,for(i=(s=3^(k-1))+1,3^k,v[i]=if((i-s)%2,v[(i-s+1)\2],k+1)));v
    
  • Python
    def A199570_list(row):
        A = [1]
        for i in range(2,row+1):
            z = 2*(3**(i-2))
            for j in range(1,z+1):
                if j%2 != 0: A.append(A[int((j-1)/2)])
                else: A.append(i)
        return(A) # John Tyler Rascoe, Feb 19 2023