19307

Appears in sequences

• Pseudoprimes to base 90.at n=30A020218
• a(n) = a(n-1) + a(n-2) + 1 for n>1, a(0)=0, a(1)=3.at n=19A022308
• Number of binary [ n,4 ] codes without 0 columns.at n=16A034345
• Pisot sequence L(4,9).at n=10A048582
• Diagonal sums of number array A082046.at n=14A082047
• Poincaré series [or Poincare series] (or Molien series) for a certain six-fold wreath product P_6.at n=40A091769
• a(n) = A011782(n) + A000219(n) - A000712(n).at n=15A116600
• Number of partitions of n-1 boys and one girl with no couple.at n=29A120452
• Smallest number whose seventh power has at least n digits.at n=30A130081
• Number of n X n arrays of the minimum value of corresponding elements and their horizontal, vertical, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..2 n X n array.at n=4A219210
• Number of nX5 arrays of the minimum value of corresponding elements and their horizontal, vertical, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..2 nX5 array.at n=4A219214
• T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal, vertical, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..2 nXk array.at n=40A219217
• Total number of smallest parts in all partitions of n minus the total number of smallest parts that are also emergent parts in all partitions of n with at least one distinct part.at n=28A220489
• Volume of Johnson square pyramid placed upright on cube (rounded down) with edge lengths equal to n.at n=24A227221
• Numbers k such that k^8 starts with k itself (in base 10).at n=12A233454
• Guttmann-Torrie simple cubic lattice series coefficients c_n^{2}(Pi/4).at n=7A259811
• Positive integers m such that pi(m^2) = pi(j^2) + pi(k^2) for no 0 < j <= k < m.at n=51A262408
• MM-numbers of crossing set partitions.at n=20A324324
• a(n) = Sum_{i=1..n, gcd(i,n)=1} i*phi(i) where phi is Euler's totient function A000010.at n=50A333291
• Odd composite integers m such that U(m)^2 == 1 (mod m) and V(m) == 7 (mod m), where U(m) and V(m) are the m-th generalized Lucas and Pell-Lucas numbers of parameters a=7 and b=-1, respectively.at n=30A337630