77701

Appears in sequences

• p(p^2-p+1) as p runs through the primes.at n=13A083558
• Square array T(n, k) = Product_{j=1..n} ( Sum_{i=0..j-1} ((k+1)^2 - (k+1))^i ) with T(n, 0) = n!, read by antidiagonals.at n=48A156881
• Number of (n+1) X (1+1) 0..2 arrays with the upper median equal to the lower median in every 2 X 2 subblock.at n=5A235974
• Number of (n+1)X(6+1) 0..2 arrays with the upper median equal to the lower median in every 2X2 subblock.at n=0A235979
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the upper median equal to the lower median in every 2X2 subblock.at n=15A235981
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the upper median equal to the lower median in every 2X2 subblock.at n=20A235981
• Number of (binary) max-heaps on 2n elements from the set {0,1} containing n 0's and n 1's.at n=17A309050
• a(n) is the smallest positive integer which can be represented as the sum of distinct nonzero n-gonal pyramidal numbers in exactly n ways, or 0 if no such integer exists.at n=28A350210
• a(n) = m is the least m = b*c > a(n-1) such that (b+c)*n = m-1 where 1 < b <= c < m.at n=41A364171