22936

Appears in sequences

• [ (4th elementary symmetric function of P(n))/(2nd elementary symmetric function of P(n)) ], where P(n) = {1, p(1), p(2), ..., p(n-1)}, where p(0) = 1.at n=17A024535
• Numbers whose square with its last digit deleted is also a square.at n=21A031149
• Numbers k such that there is a number m < k satisfying A000203(k) = A000203(m) = m + k - gcd(m,k).at n=32A124141
• a(1)=3, a(2)=4, a(n) = 3*a(n-1) + 4*a(n-2).at n=7A189738
• Numbers k for which phi(k^2) = phi(k-1) * phi(k+1).at n=9A220169
• Number of (n+1) X (2+1) 0..6 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 3, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=2A235065
• Number of (n+1) X (3+1) 0..6 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 3, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=1A235066
• T(n,k) is the number of (n+1) X (k+1) 0..6 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 3, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=7A235071
• T(n,k) is the number of (n+1) X (k+1) 0..6 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 3, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=8A235071
• Numbers m such that phi(m) = k*phi(m-k) for some number 1 <= k < m - 2.at n=43A266267
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 814", based on the 5-celled von Neumann neighborhood.at n=39A273644
• Number of normal multisets that cannot be expressed as the multiset-union of a set of sets.at n=21A292432
• Solutions to A000010(x) + A000010(x-1) = A000010(2*x).at n=13A299535
• a(n) = 2*(3*n+1)*(9*n+8).at n=20A304506
• Sum of the prime parts in the partitions of n into 6 parts.at n=38A309467
• Array read by antidiagonals: T(n,k) (n>=1, k>=1) = number of ways to select four points from an n X k grid so that three of them form a triangle of nonzero area and the extra point is strictly inside the triangle.at n=71A334709
• Array read by antidiagonals: T(n,k) (n>=1, k>=1) = number of ways to select four points from an n X k grid so that three of them form a triangle of nonzero area and the extra point is strictly inside the triangle.at n=72A334709
• Number of palindromes < 10^n whose squares are also palindromes.at n=43A343098
• Number of connected dominating sets in the n-trapezohedral graph.at n=6A381794