18037

Appears in sequences

• Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted the two central terms are both 29.at n=3A031617
• Numbers k such that k!!! + 1 is prime (0 is included by convention).at n=38A037083
• Discriminants of real quadratic fields with class number 2 and related continued fraction period length of 17.at n=24A051982
• Integers n > 10553 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 10553.at n=13A063061
• Sum of the aliquot divisors of n-th Fibonacci number.at n=24A074283
• Symmetric square table of coefficients, read by antidiagonals, where T(n,k) is the coefficient of x^n*y^k in f(x,y) that satisfies f(x,y) = 1/[(1-x)(1-y)] + xy*f(x,y)^3.at n=60A086629
• Main diagonal of square table A086629; coefficients of x^n*y^n in f(x,y) that satisfies f(x,y) = 1/[(1-x)(1-y)] + xy*f(x,y)^3.at n=5A086630
• Number of Catalan knight paths from (0,0) to (n,2) in the region between and on the lines y=0 and y=3. (See A096587 for the definition of Catalan knight.).at n=19A099330
• Number of nX3 1..3 arrays containing at least one of each value, all equal values connected, rows considered as a single number in nondecreasing order, and columns considered as a single number in nondecreasing order.at n=8A166801
• Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths starting at each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 6, n >= 2.at n=37A214025
• Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths starting at each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 7, n >= 2.at n=37A214037
• Number of union-closed partitions of weight n.at n=42A225973
• Number of n X n 0..1 arrays with every element equal to 2, 3, 4 or 5 king-move adjacent elements, with upper left element zero.at n=4A297971
• Number of nX5 0..1 arrays with every element equal to 2, 3, 4 or 5 king-move adjacent elements, with upper left element zero.at n=4A297975
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 2, 3, 4 or 5 king-move adjacent elements, with upper left element zero.at n=40A297978