9342

Properties

Appears in sequences

• Taylor series related to one in Ramanujan's Lost Notebook.at n=25A006305
• s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Lucas numbers), t = A014306.at n=35A025097
• Numbers n such that phi(3n-1) = sigma(n).at n=41A067232
• Numbers k such that sigma(k) = phi(k*omega(k)-1).at n=38A067878
• Number of ways to partition {1,2,...,n} into arithmetic progressions, where in each partition all the progressions have the same common difference and have lengths >= 2.at n=21A072255
• Non-balanced numbers in A015765.at n=41A074868
• Deterministic completely defined quasi-acyclic automata with 2 inputs, n transient and k absorbing labeled states.at n=18A082169
• Least multiple k of prime(n) such that (k-1,k+1) forms a twin prime pair, or 0 if no such number exists.at n=39A090530
• Unreduced numerators of the elements T(n,k)/(n-k)!, read by rows, of the triangular matrix P^-1, which is the inverse of the matrix defined by P(n,k) = (-k^2)^(n-k)/(n-k)! for n >= k >= 1.at n=17A103240
• Numbers n such that sum of n-th and (n+1)-st semiprimes is a square=q^2.at n=43A109311
• Number of slanted n X 4 (i=1..n) X (j=i..4+i-1) 1..4 arrays with all 1s connected, all 2s connected, all 3s connected, all 4s connected, 1 in the upper left corner, 2 in the upper right corner, 3 in the lower left corner, 4 in the lower right corner, and with no element having more than 2 neighbors with the same value.at n=30A165378
• a(1)=4. a(n+1) = a(n)+d-1, where d is the smallest prime divisor of (a(n)-1)*(a(n)+1).at n=45A177929
• Number of n X 5 arrays of the minimum value of corresponding elements and their horizontal or vertical neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..1 n X 5 array.at n=19A219499
• Numbers k with property that for every base b >= 2, there is a number m such that m+s(m) = k, where s(m) = sum of digits in the base-b expansion of m.at n=37A230624
• Number of steps between two valleys at height 0 in the infinite Dyck path in which the k-th ascending line segment has A141285(k) steps and the k-th descending line segment has A194446(k) steps, k >= 1.at n=25A233968
• Number of partitions of n, where the difference between the number of odd parts and the number of even parts is 7.at n=43A240016
• Number of 3-element subsets of {1,...,n} whose sum has more than 3 divisors.at n=42A241564
• Number T(n,k) of partitions of n into parts of exactly k sorts; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=39A255970
• Numbers n such that the decimal expansions of both n and n^2 have 2 as smallest digit and 9 as largest digit.at n=41A257485
• Expansion of Product_{k>0} ((1-x^{5k-2}) * (1-x^{5k-3})/((1-x^{5k-1}) * (1-x^{5k-4})))^3 in powers of x.at n=47A285443