26479

Properties

Appears in sequences

• Primes that remain prime through 4 iterations of function f(x) = 9x + 10.at n=16A023327
• Primes p such that p and p^2 have same digit sum.at n=32A058370
• Prime(n) and prime(n+2) use the same digits.at n=34A069794
• Indices of primes in the sequence defined by A(0) = 29, A(n) = 10*A(n-1) - 21 for n > 0.at n=19A101965
• Number of extreme n-breakable vectors.at n=27A141348
• E.g.f. = exp(-x*(x+4)/2)/(1-x)^3.at n=7A194019
• Triangle of coefficients of polynomials v(n,x) jointly generated with A210741; see the Formula section.at n=52A210742
• Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths incorporating each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 4, n >= 2.at n=36A214510
• Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths incorporating each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 8, n >= 2.at n=15A214605
• Primes of the form 2*n^2 + 42*n + 19.at n=14A221903
• Primes p with prime(p)^3 + 2*p^3 and p^3 + 2*prime(p)^3 both prime.at n=11A236574
• Numbers n such that the digital sum of n is the same as the digital sum of n^2 in both base 2 and base 10.at n=20A261640
• Primes of the form 8*n^2+8*n+31.at n=41A289839
• Primes p whose last digit is the same as that of both its predecessor prime and its successor prime.at n=25A298075
• Hash Parker numbers: Integers whose real 32nd root's first six nonzero digits (after the decimal point) rearranged in ascending order are equal to 234477.at n=15A309979
• For 1<=x<=n, 1<=y<=n, with gcd(x,y)=1, write 1 = gcd(x,y) = u*x+v*y with u,v minimal; a(n) = sum of the values of u^2+v^2.at n=28A345431
• Number of ways to write a + b + c = d + e = f with {a,b,c,d,e,f} a subset of [n] of size 6 and a < b < c and d < e.at n=44A362717
• Triangular array T(n,k), read by rows: coefficients of strong divisibility sequence of polynomials p(1,x) = 1, p(2,x) = 3 + 2*x, p(n,x) = u*p(n-1,x) + v*p(n-2,x) for n >= 3, where u = p(2,x), v = 1 - 2*x - x^2.at n=40A367300
• Prime numbersat n=2908