159390

Appears in sequences

• Smallest number m such that when A051953 is applied n times to m the result is neither a power of 2 nor 0.at n=23A053476
• Triangular array giving number of labeled graphs on n unisolated nodes and k=0...n*(n-1)/2 edges.at n=50A054548
• Numbers k such that phi(k) < k/5.at n=20A066765
• Integers which have more than one coprime factorization into nonprime powers which sum to the same number.at n=19A072940
• Product of all primes contained as binary substrings in binary representation of n.at n=23A078828
• Triangle read by rows: T(n,k) (n >= 2, k >= 0) is the number of non-crossing connected graphs on n nodes on a circle, having k interior faces. Rows are indexed 2,3,4,...; columns are indexed 0,1,2,....at n=31A089434
• Smallest number m such that the trajectory of m under iteration of cototient function[=A051953] contains exactly n distinct numbers (including m and the fixed point=0). Or: the required number of iterations[=operations,transitions] is n-1.at n=30A098197
• a(n) = 2^n mod reverse(2^n).at n=21A103167
• Integers that can be expressed as a product of triangular numbers in 3 different ways.at n=7A110904
• Triangle read by rows: T(n,k) (n >= 2, 1 <= k <= 2n-3) is the number of non-crossing connected graphs on n nodes on a circle, having k edges. Rows are indexed 2,3,4,...; columns are indexed 0,1,2,....at n=59A127537
• Numbers with prime factorization pqrstu^2.at n=18A189985
• Numbers k such that Euler phi(Dedekind psi(k)) > k.at n=11A196200
• a(n) = 3*binomial(n+1, 5).at n=23A253942
• Number of orbits of Aut(Z^7) as function of the infinity norm n of the representative lattice point of the orbit, when the cardinality of the orbit is equal to 161280.at n=24A266395
• Triangle T(m, n) = the number of point-labeled graphs with n points and m edges, no points isolated. By rows, n >= 0, ceiling(n/2) <= m <= binomial(n,2).at n=34A276639
• Expansion of e.g.f. 1/(1 - (x * (exp(x) - 1))^3 / 36).at n=11A353884
• Expansion of e.g.f. exp( (x * (exp(x) - 1))^3 / 36 ).at n=11A353895