19361

Appears in sequences

• Number of partitions of n that do not contain 4 as a part.at n=40A027338
• a(n) is the decimal concatenation of n and n^2.at n=18A053061
• a(n)=60*sum(1<=i<=j<=k<=n,i^2*j/k).at n=6A088942
• Smallest composite number n such that every divisor > 1 includes n as a substring.at n=19A105582
• Semiprimes in A056109.at n=36A113528
• a(n) = 40*n^2 + 1.at n=22A158602
• Number of (n+2) X 8 binary arrays with every 3 X 3 subblock commuting with each horizontal and vertical neighbor 3 X 3 subblock.at n=15A190030
• G.f.: A(x) = x/(1-x) o x/(1-x^3) o x/(1-x^5) o x/(1-x^7) o..., a composition of functions x/(1-x^(2*n-1)) for n=1,2,3,...at n=21A206720
• a(n) is the first prime index where the gap between R(n), Riemann's prime counting function, and Pi(n), the exact prime counting function, is greater than n.at n=8A226473
• Integers n not of form 3m+1 such that for any integer k>0, n*10^k-1 has a divisor in the set { 7, 11, 13, 37 }.at n=2A243974
• Number of length 5+3 0..n arrays with every four consecutive terms having the sum of some three elements equal to three times the fourth.at n=11A248542
• Concatenation of prime(n) and its square.at n=7A271422
• Irregular triangle read by rows: T(n,k) is the number of primes with n balanced ternary digits of which 2k+1 (3 <= 2k+1 <= n) are nonzero.at n=33A277514
• G.f.: 1/(1 + x/(1 + 2*x^2/(1 + 3*x^3/(1 + 4*x^4/(1 + 5*x^5/(1 + 6*x^6/(1 + ... ))))))), a continued fraction.at n=39A285409
• E.g.f.: exp(Sum_{n>=1} n!*x^n).at n=5A293847
• a(n) is the number of sets modulo n which can be formed by a finite arithmetic sequence.at n=38A331503
• Main diagonal of A332369.at n=17A332370
• Successive records of function f(x) = log(abs(pi(x) - R(x)))/log(x) where pi(x) is the number of primes <= x and R(x) is Riemann's prime counting function.at n=44A353055
• a(n) = 12*n^2 + 4*n + 1.at n=40A381390
• Number of multisets summing to n that do not contain 1 and are not the first sums of any multiset.at n=47A390431