46830

Appears in sequences

• Triangle read by rows: T(n,k) is the number of labeled 2-connected planar graphs with n nodes and k edges, n >= 3, n <= k <= 3(n-2).at n=18A100960
• Numbers k having exactly 5 distinct prime factors, the largest of which is greater than or equal to sqrt(k) (i.e., sqrt(k)-rough numbers with exactly 5 distinct prime factors).at n=1A115959
• Triangular array T(n,k) giving number of 2-connected graphs with n labeled nodes and k edges (n >= 3, n <= k <= n(n-1)/2).at n=22A123534
• Table of row functions R(n,x) that satisfy: [x^k] exp( k * R(n,x) ) = k^n * [x^(k-1)] exp( k * R(n,x) ) for k>=1, n>=1, read by antidiagonals.at n=30A300620
• G.f.: Product_{n>=1} (1 - 2*x^n)^3.at n=35A322216
• Averages k of twin prime pairs such that A075255(k) is also the average of a twin prime pair.at n=10A340570
• a(n) = Sum_{k=1..n} sigma(k)*sigma(2*k), where sigma(n) = A000203(n) is the sum of the divisors of n.at n=26A347108
• Members of A014574 with sum of prime factors (with multiplicity) also in A014574.at n=27A349455
• Products of 5 distinct primes that are sandwiched between twin prime numbers.at n=29A376380