30702

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=18A053476
• 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=25A098197
• Triangle read by rows: T(n,k) is the number of deco polyominoes of height n and having k columns ending at an even level (1<=k<=n). A deco polyomino is a directed column-convex polyomino in which the height, measured along the diagonal, is attained only in the last column.at n=45A121698
• Number of deco polyominoes of height n in which all columns end at an odd level. A deco polyomino is a directed column-convex polyomino in which the height, measured along the diagonal, is attained only in the last column.at n=9A121753
• Binomial transform of [1, 5, 10, 10, 5, 1, 1, -1, 1, -1, 1, ...].at n=17A140228
• a(n) = 17*n*(n+1).at n=42A173308
• Square array A(n,k), n>=1, k>=1, read by antidiagonals: A(n,k) is the number of n-colorings of the complete bipartite graph K_(k,k).at n=42A212085
• Number of partitions of 2n into parts such that the largest multiplicity equals n.at n=50A232697
• Number of partitions of n such that the number of parts having multiplicity >1 is a part and the number of distinct parts is not a part.at n=44A241411
• Rhonda numbers in vigesimal number system.at n=5A255732
• Smallest Product_{i:lambda} prime(i) for any complete partition lambda of n.at n=28A259941
• Square array A(n,k) (n>=1, k>=1) read by antidiagonals: A(n,k) is the number of n-colorings of the Möbius ladder M_k on 2k vertices.at n=42A277444
• Harary index of the n X n queen graph.at n=17A296196
• a(n) = 3*(n+1)*(9*n+4).at n=33A304503
• A variant of A008336 based on polynomials over GF(2) (see Comments for precise definition).at n=15A369407
• Number of integer partitions of n whose product is a proper multiple of n.at n=51A380219