34478

Appears in sequences

• a(n) is the number of numbers removed in each step of Eratosthenes's sieve for 10!.at n=7A145537
• a(n) is the n-th J_20-prime (Josephus_20 prime).at n=13A163800
• a(1) = 1; a(n) = Sum_{k=1..n} a(ceiling((n-1)/k)).at n=46A290845
• Consider the graph with one central vertex connected to three outer vertices (a star graph). Then, a(n) is the minimum number of moves required to transfer a stack of n pegs from one outer vertex to another outer vertex, moving pegs to adjacent vertices, following the rules of the Towers of Hanoi.at n=45A291876
• Number of unordered pairs (p,q) of distinct partitions of n such that the set of parts in q is equal to the set of parts in p.at n=29A369697