23979

Appears in sequences

• a(n) = 10000*log(n) rounded to nearest integer.at n=10A004244
• a(n) = ceiling(10000*log(n)).at n=10A004245
• Triangle read by rows: a(m,m) = 1, for all m. For n < m, a(m,n) = a(m-1,n) + (sum of all terms in rows 1 through m-1).at n=34A159924
• Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths incorporating each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 4, n >= 2.at n=32A214510
• Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths incorporating each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 8, n >= 2.at n=13A214605
• G.f. satisfies: A(x) = (1+x+x^2) * A(x^2)^2.at n=34A237651
• Number of subsets of {1..n} containing no differences or quotients of pairs of distinct elements.at n=23A326490
• Numbers k such that both Sum_{i=1..k} i*prime(i) and Sum_{i=1..k} (k+1-i)*prime(i) are prime.at n=34A356178