43356
domain: N
Appears in sequences
- Number of length n+3 0..5 arrays with every four consecutive terms having the sum of some three elements equal to three times the fourth.at n=21A248534
- a(n) = s(n) - prime(n+1)+3, where s(n) = smallest even number x > prime(n) such that the difference x-p is composite for all primes p <= prime(n).at n=39A298736
- Total number of nodes summed over all lattice paths from (0,0) to (n,n) that do not go above the diagonal x=y and consist of steps (h,v) with min(h,v) > 0 and gcd(h,v) = 1.at n=10A308114
- Numbers j in pairs (j,k), with j <> k +- 1, such that the sum of their cubes is equal to a centered cube number.at n=44A352135
- a(n) = (3*(2*n - 1)^2*((2*n - 1)^2 + 2) + 2*n + 1)/2 for n > 0.at n=6A352757
- Triangle read by rows: Coefficients of the polynomials S1(n, x) * EP(n, x), where S1 denote the unsigned Stirling cycle polynomials A132393 and EP the Eulerian polynomials A173018.at n=38A373570