22428

Appears in sequences

• Expansion of e.g.f. cos(x)/cosh(log(1+x)).at n=9A009108
• Gromov-Witten invariants of intersection type (2,2,3).at n=1A090008
• a(n) = Fibonacci(2n+1) * binomial(2n,n).at n=5A102307
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, -1, 1), (-1, 0, 0), (-1, 1, 0), (1, 0, 0)}.at n=11A148504
• 28-gonal numbers: a(n) = n*(13*n - 12).at n=42A161935
• Triangle T, read by rows : T(n,k) = A007318(n,k)*A005773(n+1-k).at n=48A171651
• Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k increasing cycles (0<=k<=n). A cycle (b(1), b(2), ...) is said to be increasing if, when written with its smallest element in the first position, it satisfies b(1) < b(2) < b(3) < ... .at n=49A186754
• Constant term of the reduction by x^2 -> x+1 of the polynomial p(n,x) defined at Comments.at n=16A192971
• Triangle read by rows: coefficients in an asymptotic expansion of the n-th prime.at n=29A200265
• Number of 0..n arrays of length 5 with each element differing from at least one neighbor by 1 or less.at n=20A221597
• Number of n X 2 0..2 arrays x(i,j) with each element horizontally, vertically, diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 3 and at least one element with value (x(i,j)-1) mod 3, and upper left element zero.at n=5A230920
• Number of nX6 0..2 arrays x(i,j) with each element horizontally, vertically, diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 3 and at least one element with value (x(i,j)-1) mod 3, and upper left element zero.at n=1A230924
• T(n,k)=Number of nXk 0..2 arrays x(i,j) with each element horizontally, vertically, diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 3 and at least one element with value (x(i,j)-1) mod 3, and upper left element zero.at n=22A230926
• T(n,k)=Number of nXk 0..2 arrays x(i,j) with each element horizontally, vertically, diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 3 and at least one element with value (x(i,j)-1) mod 3, and upper left element zero.at n=26A230926
• Numbers n such that there exists an x!=n that makes {n,n,x} an amicable multiset.at n=6A259302
• Numbers that belong to at least one amicable multiset.at n=41A259307
• Expansion of Product_{k>=1} 1/(1 - (3*k-2)*x^(3*k-2)).at n=26A265821
• Irregular triangle read by rows: T(n,k) is the number of necklaces of n 1's, n -1's, and k 0's such that no two adjacent elements are equal.at n=58A283615
• Abundant numbers n such that sigma(sigma(n) - 2*n) = sigma(n).at n=8A292365
• a(n) = a(n-1) + 3*a(n-2) -2*a(n-3) - 2*a(n-4), where a(0) = -1, a(1) = 0, a(2) = 0, a(3) = 1.at n=20A295730