19912

Appears in sequences

• Triangle of Eulerian numbers with rows multiplied by 1 + x.at n=39A008518
• Triangle of Eulerian numbers with rows multiplied by 1 + x.at n=41A008518
• Number of partitions of n with equal number of parts congruent to each of 0 and 1 (mod 3).at n=52A035534
• Triangle T(n,k) read by rows giving number of fixed 4 X k polyominoes with n cells (n >= 4, 1<=k<=n-3).at n=49A059680
• Triangle T(n,k) giving number of fixed 5 X k polyominoes with n cells (n >= 5, 1<=k<=n-4).at n=39A059681
• Numbers n such that 2*10^n + 5*R_n + 4 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=7A102956
• Base-2 logarithm of (n-th even superperfect number divided by 2^n).at n=23A134712
• Triangle T(n, k) = T(n-1, k) + T(n-1, k-1) + j*prime(j)*T(n-2, k-1) with j=3, read by rows.at n=24A153648
• Expansion of (1+x)/(1-x^2-3*x^5).at n=30A238391
• a(n) = (round(c^prime(n)) - 1)/prime(n), where c is the pentanacci constant (A103814).at n=3A239564
• Number of pairs of functions (f,g) from a set of n elements into itself satisfying f(g(x)) = f(g(g(x))).at n=4A239785
• Number of (n+2)X(1+2) 0..3 arrays with every 3X3 subblock row and column sum equal to 0 2 3 6 or 7 and every 3X3 diagonal and antidiagonal sum not equal to 0 2 3 6 or 7.at n=14A252107
• Triangle, read by rows, that transforms diagonals in the array A274390 of coefficients in successive iterations of Euler's tree function (A000169).at n=16A274570
• Column 1 of triangle A274570.at n=4A274572
• a(n) is the largest number that is not the sum of distinct n-gonal pyramidal numbers.at n=11A352350
• Number of degree 3 vertices in the n-Sierpinski carpet graph.at n=4A365607
• Expansion of (x^2 + x - 1)/((1 - x)*(2*x^2 + 3*x - 1)). Row sums of A371300.at n=8A371301
• Expansion of (1+3*x+x^2) / (1-x-5*x^2-2*x^3).at n=9A384647