42420

Appears in sequences

• Dying rabbits: a(n) = a(n-1) + a(n-2) - a(n-10).at n=24A023440
• A triangle of infinite sum coefficients with: Limit[Log[1-x],x->0]=-x: p(x,y)=1+n!*x^(n - 1)*Sum[x^k/(k*Binomial[n + k, k]), {k, 1, Infinity}]; such that Log[1-x]->-x.at n=31A157047
• Number of nX3 0..3 arrays with values 0..3 introduced in row major order and each element equal to one or two horizontal and vertical neighbors.at n=4A199144
• Number of nX5 0..3 arrays with values 0..3 introduced in row major order and each element equal to one or two horizontal and vertical neighbors.at n=2A199146
• T(n,k)=Number of nXk 0..3 arrays with values 0..3 introduced in row major order and each element equal to one or two horizontal and vertical neighbors.at n=23A199149
• T(n,k)=Number of nXk 0..3 arrays with values 0..3 introduced in row major order and each element equal to one or two horizontal and vertical neighbors.at n=25A199149
• Number of ordered triples (w,x,y) with all terms in {-n, ..., -1, 1, ..., n} and 5w + x + y > 0.at n=22A211630
• Start with 0. Successive digits in the sequence must differ by 2. Adjoin the smallest number not yet in the sequence.at n=48A228327
• Number of (n+3)X(2+3) 0..1 arrays with each row divisible by 11 and column not divisible by 11, read as a binary number with top and left being the most significant bits.at n=6A263285
• a(n) = Sum_{i=1..n-1}(i^(n-2)) mod n^4.at n=14A284760
• Total number of parts coprime to n in the partitions of n into 10 parts.at n=40A363328
• Triangle read by rows: T(n,k) is the number of face-connected polyhedral components consisting of k cuboctahedra and n-k octahedra in the rectified cubic honeycomb up to translation, rotation, and reflection of the honeycomb, 0<=k<=n.at n=48A384782