19423

Properties

Appears in sequences

• a(n) = a(n-2) + a(n-3), with a(0) = 0, a(1) = 1, a(2) = 2.at n=36A007307
• a(n) = prime(100*n).at n=21A031921
• Primes followed by a [4,2,4] prime difference pattern of A001223.at n=34A052378
• Primes which are the concatenation of numbers n_1, n_2, n_3, in that order, with n_1 + n_2 = n_3 (leading zeros are forbidden for nonzero n_i).at n=31A067860
• Primes in which the digit string can be partitioned into three parts such that the sum of the first two is equal to the third, and the second part is nonzero.at n=30A088291
• Solutions to A096509[x]=6; number of prime-powers [including primes] in the neighborhood of x with Ceiling[Log[x]] radius equals 6.at n=15A096517
• Primes occurring in exactly three prime triples (p,q,r) with p<q<r=p+6.at n=12A098423
• Expansion of (1-x-2*x^2)/(1-x^2+x^3).at n=40A109248
• a(n) = n^3 + 71*n + 1.at n=26A124363
• Prime quadruples: 2nd term.at n=18A136720
• a(n) = A098601(2n) + A098601(2n+1).at n=17A137495
• a(n) = 3*a(n-1) - 2*a(n-2) + a(n-3).at n=11A137531
• Primes congruent to 12 mod 59.at n=37A142739
• Primes in toothpick sequence A153003.at n=36A153005
• Transform of the finite sequence (1, 0, -1) by the T_{0,0} transformation.at n=13A159347
• Number of binary strings of length n with no substrings equal to 0010 0101 or 1010.at n=13A164494
• Triangle read by rows, T(n,k) = Sum_{j=0..n-k+1} P(n,j)*T(n-j,k-1) if k>0 else 0^n where P(n,j) is the number of j-partitions of n; for n>=0 and 0<=k<=n.at n=60A257566
• Table read by rows: list of prime 5-tuples of the form (p, p+2, p+6, p+8, p+12).at n=26A270998
• Table read by rows: list of prime 5-tuples of the form (p, p+4, p+6, p+10, p+12).at n=37A270999
• Table read by rows: list of prime sextuplets (p, p+4, p+6, p+10, p+12, p+16).at n=20A271000