25955

Appears in sequences

• A000041(n) - A000203(n).at n=37A086738
• a(0) = a(1) = 1; for n >= 2, a(n) = a(n-1) + a(n-2) - n if that number is positive and not already in the sequence, otherwise a(n) = a(n-1) + a(n-2) + n.at n=23A117821
• Triangle T(n, k) = T(n-1, k) + T(n-1, k-1) + (2*j +7)*prime(j)*T(n-2, k-1) with j=10, read by rows.at n=11A153657
• Triangle T(n, k) = T(n-1, k) + T(n-1, k-1) + (2*j +7)*prime(j)*T(n-2, k-1) with j=10, read by rows.at n=13A153657
• Number of (n+2) X (4+2) 0..1 arrays with no 3 x 3 subblock diagonal sum 0 and no antidiagonal sum 3 and no row sum 1 and no column sum 1.at n=20A257443
• Numbers m such that each of p=6*m+1, q=6*p+1, r=6*q+1 and s=6*r+1 is prime.at n=30A263311
• a(n) = 5*(3*n+1)*(9*n+8)/2 (n>=0).at n=19A304508
• Numbers k such that 4*k + 3 is a perfect cube, sorted by absolute values.at n=23A305291
• Number of lattice paths from (0,0) to (n,n) using steps (0,1), (1,0), (1,1), (1,2), (2,1).at n=6A339565