34350

Appears in sequences

• Numbers k such that 3*2^k + 1 is prime.at n=25A002253
• Number of polyhexes with n cells.at n=9A038147
• Numbers k such that n | sigma_10(k) + phi(k)^10.at n=18A055704
• a(n) = (1/24)*(n+1)*(n+6)*(n^3+26*n^2+225*n+636).at n=10A090948
• Total Wiener index of star-like trees with n edges.at n=13A186310
• Number of 0..3 arrays x(0..n+1) of n+2 elements without any interior element greater than both neighbors.at n=6A200881
• T(n,k) is the number of 0..k arrays x(0..n+1) of n+2 elements without any interior element greater than both neighbors.at n=42A200886
• Number of 0..n arrays x(0..8) of 9 elements without any interior element greater than both neighbors.at n=2A200892
• Number of nX1 0..3 arrays with every nonzero element less than or equal to some horizontal or vertical neighbor.at n=9A203094
• T(n,k) = number of n-element 0..3 arrays with each element the minimum of k adjacent elements of a random 0..3 array of n+k-1 elements.at n=53A217954
• Number of n X 2 0..3 arrays with no element less than a strict majority of its horizontal and antidiagonal neighbors.at n=4A231833
• T(n,k)=Number of nXk 0..3 arrays with no element less than a strict majority of its horizontal and antidiagonal neighbors.at n=19A231839
• Number of 5Xn 0..3 arrays with no element less than a strict majority of its horizontal and antidiagonal neighbors.at n=1A231843
• Numbers k such that 3*2^k + 1 is a prime factor of a generalized Fermat number 3^(2^m) + 1 for some m.at n=18A268657
• Numbers k such that sigma(phi(k)) - phi(k) = phi(sigma(k)), where phi(k) is the Euler totient function of k and sigma(k) is the sum of the divisors of k.at n=14A271633
• Numbers k such that 3*2^k + 1 is a prime factor of a generalized Fermat number 11^(2^m) + 1 for some m.at n=8A282944
• Number of multiset partitions of integer partitions of n where all parts have the same product.at n=33A320886
• G.f. A(x) satisfies: A(x) = x * exp( A(x)^2/x - A(-x^2)^2/(2*x^2) + A(x^3)^2/(3*x^3) - A(-x^4)^2/(4*x^4) + ... ).at n=9A363293