34477

Appears in sequences

• Numbers n such that sigma_3(n) is divisible by square of cototient of n, while n is not a prime number.at n=18A091286
• Minimal exponents m such that the fractional part of (1024/1000)^m obtains a maximum (when starting with m=1).at n=34A153679
• Numbers k such that the fractional part of (1024/1000)^k is greater than 1-(1/k).at n=12A153680
• Numbers x such that 0 < |x^9 - y^7| < x^(47/7) for some number y.at n=3A173370
• Number of nX2 arrays of occupancy after each element moves to some king-move neighbor, without consecutive moves in the same direction.at n=4A221430
• T(n,k)=Number of nXk arrays of occupancy after each element moves to some king-move neighbor, without consecutive moves in the same direction.at n=16A221432
• T(n,k)=Number of nXk arrays of occupancy after each element moves to some king-move neighbor, without consecutive moves in the same direction.at n=19A221432
• Number of partitions p of n such that (sum of parts with multiplicity 1) > (sum of all other parts).at n=44A240451
• Number of 5Xn 0..1 arrays with every element equal to 0, 2 or 3 horizontally or antidiagonally adjacent elements, with upper left element zero.at n=9A301909
• Expansion of e.g.f. Product_{k>=1} exp(x^k) / (1 - x^k).at n=6A330200
• Sum of the areas of all r X s rectangles such that r + s = 2n, with r, s composite.at n=43A334229
• Expansion of e.g.f. 1 / (6 - 5 * exp(x))^(1/5).at n=5A346984
• Triangle read by rows: T(n, k) is the number of k-dimensional subspaces in (F_8)^n, counted up to coordinate permutation (n >= 0, 0 <= k <= n).at n=23A347974
• Triangle read by rows: T(n, k) is the number of k-dimensional subspaces in (F_8)^n, counted up to coordinate permutation (n >= 0, 0 <= k <= n).at n=25A347974