29673

Appears in sequences

• Pisot sequence T(4,6), a(n) = floor(a(n-1)^2/a(n-2)).at n=33A020747
• Pisot sequence T(6,9), a(n) = floor(a(n-1)^2/a(n-2)).at n=32A020751
• a(n) = n-th prime number * n-th lucky number.at n=36A032601
• Numbers k such that there are 15 primes between 100*k and 100*k + 99.at n=23A186407
• Number of (n+1)X(2+1) 0..2 arrays with the maximum plus the upper median plus the lower median of every 2X2 subblock equal.at n=4A236878
• Number of (n+1)X(5+1) 0..2 arrays with the maximum plus the upper median plus the lower median of every 2X2 subblock equal.at n=1A236881
• T(n,k) = Number of (n+1) X (k+1) 0..2 arrays with the maximum plus the upper median plus the lower median of every 2 X 2 subblock equal.at n=16A236884
• T(n,k) = Number of (n+1) X (k+1) 0..2 arrays with the maximum plus the upper median plus the lower median of every 2 X 2 subblock equal.at n=19A236884
• Number of length n+3 0..6 arrays with every four consecutive terms having the maximum of some two terms equal to the minimum of the remaining two terms.at n=4A249705
• Number of length 5+3 0..n arrays with every four consecutive terms having the maximum of some two terms equal to the minimum of the remaining two terms.at n=5A249711
• Number of nX5 0..1 arrays with every element equal to 0, 1, 2, 3 or 6 king-move adjacent elements, with upper left element zero.at n=5A298284
• Number of nX6 0..1 arrays with every element equal to 0, 1, 2, 3 or 6 king-move adjacent elements, with upper left element zero.at n=4A298285
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 3 or 6 king-move adjacent elements, with upper left element zero.at n=49A298287
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 3 or 6 king-move adjacent elements, with upper left element zero.at n=50A298287
• Triangular array read by rows: T(n,k) is the number of cubic n-permutations possessing exactly k cycles; n >= 0, 0 <= k <= n.at n=61A348191