20565

Appears in sequences

• Numbers n such that Catalan(n)-1 is prime.at n=38A053427
• Numbers k such that k^2 - 1 is a palindrome.at n=19A070253
• Integers that are Rhonda numbers to base 14.at n=2A100972
• A106486-encodings of combinatorial games with value 2.at n=31A125995
• Number of n X n binary arrays symmetric about both diagonal and antidiagonal with all ones connected only in a 0100-0100-1111 pattern in any orientation.at n=15A146574
• 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, 0), (-1, -1, 1), (-1, 0, -1), (0, 1, 1), (1, -1, -1)}.at n=11A148064
• Expansion of b(3)*b(4)/(1 - 2*x + x^5), where b(k) = (1-x^k)/(1-x).at n=13A266337
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 169", based on the 5-celled von Neumann neighborhood.at n=32A270463
• Numbers k such that 7*10^k + 39 is prime.at n=28A275067
• A(n,k) is the n-th Rhonda number to base A002808(k), the k-th composite number; square array A(n,k), n>=1, k>=1, read by antidiagonals.at n=38A291925
• E.g.f.: Sum_{n>=0} ((1+x)^n + 4)^n * x^n/n!.at n=5A326094
• Number of strict integer partitions with sum <= n that can be linearly combined using nonnegative coefficients to obtain n.at n=47A365311