260096

Appears in sequences

• Numbers k such that sigma(k)*omega(k) = sigma(k+1)*omega(k+1), where omega(k) is the number of distinct prime divisors of n (A001221).at n=24A063071
• Number of subsets of {1,..,n} containing at least one prime.at n=17A089820
• Denominator of 2*n*A000111(n-1)/A000111(n): approximations of Pi using Euler (up/down) numbers.at n=12A132050
• Inverse binomial transform of A131800.at n=19A173315
• G.f. satisfies: A(x) = 1/A(-x*A(x)).at n=12A214761
• Number of formula representations of n using addition, exponentiation and the constant 1.at n=12A214843
• 10-step Fibonacci sequence starting with 0,0,0,0,0,0,0,1,0,0.at n=28A251760
• Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 430", based on the 5-celled von Neumann neighborhood.at n=18A288197
• Array read by antidiagonals: T(n,m) is the number of acyclic edge sets in the complete bipartite graph K_{n,m}.at n=58A328887
• Array read by antidiagonals: T(n,m) is the number of acyclic edge sets in the complete bipartite graph K_{n,m}.at n=62A328887