24079
domain: N
Appears in sequences
- Consider all ways of writing a number as p+2m^2 where p is 1 or a prime and m >= 0; sequence gives numbers that are expressible in at least 2 more ways than any smaller number.at n=19A016067
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 39 ones.at n=2A031807
- Numbers k such that s(k) + s(k+1) + s(k+2) = t(k) + t(k+1) + t(k+2) where s(k) = sigma(k) - k, t(k) = |s(k) - k|.at n=7A033910
- Composite numbers whose prime factors contain no digits other than 1 and 9.at n=20A036309
- Numerators of continued fraction convergents to sqrt(61).at n=9A041106
- Smallest integer that can be expressed as p+2m^2 in more ways than any smaller number, where m >= 0 and p = 1 or prime.at n=40A055202
- Sums of Pythagorean sextuples in increasing order: The sums of sets of six natural numbers which correspond to the lengths of the edges of a tetrahedron whose four faces are all different Pythagorean triangles.at n=44A248548
- 5-step Fibonacci sequence starting with 0,0,1,0,0.at n=20A251653
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 478", based on the 5-celled von Neumann neighborhood.at n=37A272453
- Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n), where a(0) = 2, a(1) = 3, b(0) = 1, b(1) = 4, b(2) = 5, and (a(n)) and (b(n)) are increasing complementary sequences.at n=17A295951
- Number of nX6 0..1 arrays with every element unequal to 0, 1 or 3 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=20A317771
- 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=35A356178