19759

Properties

Appears in sequences

• Powers of fifth root of 22 rounded up.at n=16A018179
• a(n) = a(n-1) + a(round(2*(n-1)/3)) + a(round((n-1)/3)) with a(1)=a(2)=1.at n=39A033499
• a(n) = the n-th prime with sum of decimal digits = n, or 0 if no such number exists.at n=30A075361
• Final terms of rows of A077321.at n=36A077323
• Smallest balanced prime of order n.at n=44A082080
• Duplicate of A075361.at n=30A082258
• Primes with digit sum = 31.at n=30A106767
• a(n) = A007290(n+2) - 1 = 2*C(n+2,3) - 1.at n=38A108766
• Least k such that 10^n + k is a Sophie Germain prime and the lesser of a twin prime pair.at n=13A118580
• A084938 * [1,2,3,...], where A084938 is taken as lower triangular matrix.at n=8A134378
• Primes congruent to 53 mod 59.at n=37A142780
• Primes congruent to 56 mod 61.at n=38A142854
• Starting at a(1)=2, a(n) is the smallest prime larger than a(n-1) such that the sum of odd digits of a(n) is not smaller than the sum of odd digits of a(n-1).at n=37A158085
• Numbers n such that (6^n-11)/5 is prime.at n=21A199165
• Pairs of consecutive primes {p,q} for which the numbers of distinct residues of all factorials mod p and mod q coincide.at n=30A210242
• Petersen graph (3,1) coloring a rectangular array: number of nX6 0..5 arrays where 0..5 label nodes of a graph with edges 0,1 0,3 3,5 3,4 1,2 1,4 4,5 2,0 2,5 and every array movement to a horizontal, diagonal or antidiagonal neighbor moves along an edge of this graph, with the array starting at 0.at n=1A223502
• T(n,k)=Petersen graph (3,1) coloring a rectangular array: number of nXk 0..5 arrays where 0..5 label nodes of a graph with edges 0,1 0,3 3,5 3,4 1,2 1,4 4,5 2,0 2,5 and every array movement to a horizontal, diagonal or antidiagonal neighbor moves along an edge of this graph, with the array starting at 0.at n=22A223504
• Petersen graph (3,1) coloring a rectangular array: number of 2 X n 0..5 arrays where 0..5 label nodes of a graph with edges 0,1 0,3 3,5 3,4 1,2 1,4 4,5 2,0 2,5 and every array movement to a horizontal, diagonal or antidiagonal neighbor moves along an edge of this graph, with the array starting at 0.at n=5A223505
• a(n) = a(n-1) + 3*a(n-2) - 2*a(n-3) - 2*a(n-4), where a(0) = 1, a(1) = 2, a(2) = 3, a(3) = 4.at n=22A295619
• Primes which yield again a prime when the digits are taken according to the lexicographically first superpermutation of corresponding order and of minimal length.at n=31A332088