19850

Appears in sequences

• Coefficient of x^4 in expansion of (1+x+x^2)^n.at n=23A005712
• Number of partitions in parts not of the form 19k, 19k+3 or 19k-3. Also number of partitions with at most 2 parts of size 1 and differences between parts at distance 8 are greater than 1.at n=41A035972
• Number of positions that are exactly n moves from the starting position in the Lights Out 2000 puzzle.at n=4A079875
• Positions of 11's in A131744.at n=9A133152
• Binary digits, representing the rows of triangle A141743, written in base 10.at n=7A141746
• Monotonic ordering of set S generated by these rules: if x and y are in S then 3xy-x-y is in S, and 2 is in S.at n=14A192529
• Number of nX4 0..3 arrays with no element equal to zero plus the sum of elements to its left or zero plus the sum of elements above it or one plus the sum of the elements diagonally to its northwest or one plus the sum of the elements antidiagonally to its northeast, modulo 4.at n=7A239854
• Least positive integer k such that k*n+1 = prime(p) and k^2*n+1 = prime(q) for some pair of primes p and q.at n=20A261437
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 126", based on the 5-celled von Neumann neighborhood.at n=41A270215
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 243", based on the 5-celled von Neumann neighborhood.at n=29A271002
• a(n) = Trinomial(2*n+1, 4) = (1/6)*n*(2*n + 1)*(2*n^2 + 9*n + 1), n >= 0.at n=12A302709