22881

Appears in sequences

• Quotients k*(k+1)*(k+2) / (k+(k+1)+(k+2)) that are lucky numbers.at n=20A032792
• Triangle, read by rows, where the n-th row lists the coefficients of the polynomial of degree n that generates the n-th diagonal of this sequence.at n=59A091150
• Number of strings of n numbers x(i) in -5..5 with sums of x(i) and of x(i)*x(i+1) both zero.at n=6A183940
• T(n,k)=Number of strings of n numbers x(i) in -k..k with sums of x(i) and of x(i)*x(i+1) both zero.at n=61A183944
• Number of nondecreasing arrangements of 7 numbers x(i) in -(n+5)..(n+5) with the sum of sign(x(i))*2^|x(i)| zero.at n=20A187991
• a(n) = (2*n^3 + 3*n^2 + n + 3)/3.at n=32A188475
• Products of 3 evil primes (A027699) p,q,r, such that numbers p*q, p*r, q*r, and p*q*r are odious (A000069).at n=25A230353
• Number of preferential arrangements of n labeled elements when at least k=6 elements per rank are required.at n=15A245791
• In base n, a(n) is the largest (decimal equivalent) number reached when one sequentially adds to a sum, starting with zero, the largest digit not in that sum.at n=5A260351
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 43", based on the 5-celled von Neumann neighborhood.at n=32A269878
• Number of series-reduced locally stable rooted identity trees whose leaves form an integer partition of n.at n=13A316766
• Total number of binary digits in all partitions of n into distinct parts.at n=41A319140
• Odd composite integers m such that A087130(m) == 5 (mod m).at n=36A335671
• Counterexamples to a conjecture of Ramanujan about congruences related to the partition function.at n=38A340757
• a(n) is the number of distinct scalar products which can be formed by pairs of signed permutations (V, W) of [n].at n=32A358655
• Number of distinct lines passing through exactly two points in a triangular grid of side n.at n=26A362014