A143343 Triangle T(n,k) (n>=0, 1<=k<=n+1) read by rows: T(n,1)=1 for n>=0, T(1,2)=2. If n>=3 is odd then T(n,k)=1 for all k. If n>=3 is even then if k is prime and k-1 divides n then T(n,k)=k, otherwise T(n,k)=1.
1, 1, 2, 1, 2, 3, 1, 1, 1, 1, 1, 2, 3, 1, 5, 1, 1, 1, 1, 1, 1, 1, 2, 3, 1, 1, 1, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, 1, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, 1, 1, 1, 1, 1, 1, 1, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, 1, 5, 1, 7, 1, 1, 1, 1, 1, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1
Offset: 0
Examples
The triangle begins: 1, 1,2, 1,2,3, 1,1,1,1, 1,2,3,1,5, 1,1,1,1,1,1, 1,2,3,1,1,1,7, 1,1,1,1,1,1,1,1, 1,2,3,1,5,1,1,1,1, 1,1,1,1,1,1,1,1,1,1, 1,2,3,1,1,1,1,1,1,1,11, 1,1,1,1,1,1,1,1,1,1,1,1, 1,2,3,1,5,1,7,1,1,1,1,1,13, 1,1,1,1,1,1,1,1,1,1,1,1,1,1, ...
References
- H. Rademacher, Topics in Analytic Number Theory, Springer, 1973, Chap. 1.
Extensions
Entry revised by N. J. A. Sloane, Aug 10 2019
Comments