44929
domain: N
Appears in sequences
- T(n, k) = Sum_{j=k..n} binomial(n, j)*E1(j, j-k), where E1 are the Eulerian numbers A173018. Triangle read by rows, T(n, k) for 0 <= k <= n.at n=40A046802
- a(n) = 78*n^2 + 1.at n=24A158769
- a(n) is the n-th J_10-prime (Josephus_10 prime).at n=8A163790
- Numbers n such that m=(n^2+1)/2, p=(m^2+1)/2 and q=(p^2+1)/2 are all prime.at n=23A188546
- The number of partitions of the set [n] where each element can be colored 1 or 2 avoiding the patterns 1^11^1 and 1^22^1 in the pattern sense.at n=11A208275
- Triangle read by rows, T(n,k) = Sum_{j=0..n} (-1)^(n-j)*C(-j-1,-n-1)*E1(j,k), E1 the Eulerian numbers A173018, for n >= 0 and 0 <= k <= n.at n=39A272098
- G.f.: Sum_{k>=0} x^(k*(k+1)) * Product_{j=1..k} ((1 + x^j)/(1 - x^j))^2.at n=30A376852