19460

Appears in sequences

• a(n) = ceiling(10000*log(n)).at n=6A004245
• a(n) = Sum{T(i,j)}, 0<=i<=n, 0<=j<=i, T given by A026714.at n=11A026723
• Product of a prime and the following number.at n=33A036690
• Expansion of (Product_{j>=1} (1-(-x)^j) - 1)^14 in powers of x.at n=11A047639
• a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2, and a(3) = 3.at n=16A049908
• Maximum of A073830(k) for k between A001359(n) and A001359(n+1).at n=10A073831
• a(n) = 4*n*(4*n - 1).at n=35A104188
• a(n) = (9*n+4)*(9*n+5).at n=15A177073
• Arises in covering a graph by forests and a matching.at n=18A179259
• Number of 0..n arrays x(0..4) of 5 elements without any interior element greater than both neighbors or less than both neighbors.at n=10A200873
• Number of -2..2 arrays x(i) of n+1 elements i=1..n+1 with set{t,u,v in 0,1}((x[i+t]+x[j+u]+x[k+v])*(-1)^(t+u+v)) having four, five or six distinct values for every i,j,k<=n.at n=8A211576
• E.g.f. satisfies: A(x) = Sum_{n>=0} log(1 + x*A(x)^(2*n))^n/n!.at n=5A221096
• Numbers that are both interprime and oblong.at n=35A263676
• E.g.f. 1/(D(x) - S(x)), where C(x)^2 - S(x)^2 = 1 and D(x)^3 - S(x)^3 = 1, and functions S(x), C(x), and D(x) are described by A280620, A280621, and A280622, respectively.at n=8A280624
• Number of squarefree parts in the partitions of n into 6 parts.at n=48A309458
• Numbers m such that the sum of the first m primes as well as the sum of the squares and the sum of the cubes of the first m primes are all prime.at n=4A329539
• Composite numbers with properties that its digits (which may appear with multiplicity) may not appear in any of its factors (wherein the digits may also appear with multiplicity) and the combined digits of the product and the factors must have at least one of each of the ten digits.at n=36A370972