19270

Appears in sequences

• Numbers n such that 9*10^n + 2*R_n + 5 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=12A103095
• Number of nX4 binary arrays whose sum with another nX4 binary array containing no more than a single 1 has rows and columns in lexicographically nondecreasing order.at n=4A225896
• Number of nX5 binary arrays whose sum with another nX5 binary array containing no more than a single 1 has rows and columns in lexicographically nondecreasing order.at n=3A225897
• T(n,k)=Number of nXk binary arrays whose sum with another nXk binary array containing no more than a single 1 has rows and columns in lexicographically nondecreasing order.at n=31A225900
• T(n,k)=Number of nXk binary arrays whose sum with another nXk binary array containing no more than a single 1 has rows and columns in lexicographically nondecreasing order.at n=32A225900
• Numbers k such that if x = sigma(k) + tau(k) - k then k = sigma(x) + tau(x) - x.at n=18A238226
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 510", based on the 5-celled von Neumann neighborhood.at n=40A272700
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 926", based on the 5-celled von Neumann neighborhood.at n=33A273778
• Greater members of dihedral amicable pairs: numbers (m, k) such that t(m) = t(k) = m + k, where t(k) = sigma(k) + d(k).at n=4A322254
• G.f. satisfies A(x) = 1 + x*A(x)^3 + x^2*A(x)^3.at n=7A364475
• Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,0) = 0^n and T(n,k) = k * Sum_{r=0..n} binomial(3r+k,r) * binomial(r,n-r)/(3*r+k) for k > 0.at n=43A378323