45151

Appears in sequences

• Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 83 ones.at n=0A031851
• Pyramid game person numbers that have integer solutions.at n=37A135051
• The Szeged index of a benzenoid consisting of a linear chain of n hexagons.at n=13A245830
• Number of partitions of 1, 2, 3, or more copies of n into distinct parts.at n=22A258289
• Least semiprime of a run of exactly n odd semiprimes.at n=17A304457
• Triangle read by rows: T(n,k) is the number of permutations p of {1..n} such that p(1)=k and p(i+1) < p(i) iff a strict majority of {1..n} \ {p(1)..p(i)} are < p(i).at n=47A318354
• Triangle read by rows: T(n,k) is the number of permutations p of {1..n} such that p(1)=k and p(i+1) < p(i) iff a strict majority of {1..n} \ {p(1)..p(i)} are < p(i).at n=52A318354
• After the initial 1, numbers k such that A347381 obtains its minimum value at k, of all the divisors d of k larger than one, where A347381 is the distance from n to the nearest common ancestor of n and sigma(n) in the Doudna-tree (A005940).at n=24A374218
• Composite numbers k such that A347381 obtains the same value for all divisors of k that are larger than one, where A347381 is the distance from n to the nearest common ancestor of n and sigma(n) in the Doudna-tree (A005940).at n=7A374219