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.

A342446 Square table read by antidiagonals downwards: T(n,k) = floor((4/(4^(1/2^n)-1))^(1/2^k)).

Original entry on oeis.org

1, 4, 1, 9, 2, 1, 21, 3, 1, 1, 44, 4, 1, 1, 1, 90, 6, 2, 1, 1, 1, 182, 9, 2, 1, 1, 1, 1, 367, 13, 3, 1, 1, 1, 1, 1, 736, 19, 3, 1, 1, 1, 1, 1, 1, 1475, 27, 4, 1, 1, 1, 1, 1, 1, 1, 2952, 38, 5, 2, 1, 1, 1, 1, 1, 1, 1, 5907, 54, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1
Offset: 0

Views

Author

Franz Vrabec, Mar 12 2021

Keywords

Comments

Every positive integer occurs infinitely often.

Examples

			T(2,1) = floor((4/(4^(1/4)-1))^(1/2)) = floor(sqrt(4/(sqrt(2)-1))) = floor(3.1075...) = 3.
		

Formula

T(n,k) = floor((4/(4^(1/2^n)-1))^(1/2^k)).