105621
domain: N
Appears in sequences
- From George Gilbert's marks problem: jumping 6 marks at a time (final positions).at n=18A019996
- Distinct odd elements in 4-Pascal triangle A028275 (by row).at n=36A028281
- Odd elements (greater than 1) to right of central elements in 4-Pascal triangle A028275.at n=34A028287
- Group the composite numbers so that the sum of the n-th group is a multiple of the n-th prime: (4), (6), (8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 22), (24, 25), (26, 27, 28, 30, 32), (33, 34, ...), ... Sequence gives sum of n-th group.at n=28A074124
- Triangle read by rows: t(n,m)=(1 + n!)*Binomial[n, m]-n!/Binomial[n, m].at n=30A144397
- Triangle read by rows: t(n,m)=(1 + n!)*Binomial[n, m]-n!/Binomial[n, m].at n=33A144397
- a(n) = 100*n^2 + 100*n + 21.at n=32A152161
- Triangle T(n, k) = T(n-1, k) + T(n-1, k-1) + ((n+1)*(n+2)/2)*T(n-2, k-1), read by rows.at n=39A154227
- Triangle T(n, k) = T(n-1, k) + T(n-1, k-1) + ((n+1)*(n+2)/2)*T(n-2, k-1), read by rows.at n=41A154227
- a(n) = 16n^4 + 64n^3 + 104n^2 + 80n + 21.at n=8A176711