20198

Appears in sequences

• Numbers that are the sum of 8 nonzero 8th powers.at n=26A003386
• Numbers that are the sum of 5 positive 9th powers.at n=7A003394
• Numbers that are the sum of at most 5 positive 9th powers.at n=29A004889
• Numbers that are the sum of at most 6 positive 9th powers.at n=37A004890
• Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite MEL = ZSM-11 Nan[AlnSi96-nO192] starting with a T5 atom.at n=13A019153
• Convolution of natural numbers with composite numbers.at n=40A023539
• Triangle partitions of order n: topologically distinct ways to dissect a triangle into n triangles.at n=5A056814
• Larger terms of the pairs (a < b) in the sequence {a,b}-> {Max[{a,b}]-Min[{a,b}],k*Min[{a,b}]} with k=3 and the first pair {a=1,b=2}. See A075256.at n=40A075258
• Number of positive integers <= 10^n that are divisible by no prime exceeding 19.at n=7A108276
• Number of Motzkin n-paths with two kinds of level steps one of which is a final step.at n=11A143013
• G.f.: A(x) = exp( 2*Sum_{n>=1} A006519(n)^2 * x^n/n ), where A006519(n) = highest power of 2 dividing n.at n=18A162581
• Monotonic ordering of set S generated by these rules: if x and y are in S then 3xy-x-y is in S, and 2 is in S.at n=17A192529
• Number of rooted identity trees with n nodes and 8-colored non-root nodes.at n=5A255520
• Number of dying nodes (withering branches) at generation n in the binary tree of persistently squarefree numbers (A293230).at n=40A293520
• Expansion of Product_{k>=1} 1/(1 - x^k)^(sigma_9(k)).at n=3A301547
• Number of pairs (lambda,mu) of partitions lambda of n and mu of ceiling(n/2) with mu <= lambda (by diagram containment).at n=21A303852
• Number of pairs (lambda,mu) of partitions lambda of 2n+1 and mu of n+1 with mu <= lambda (by diagram containment).at n=10A303863