24843

Appears in sequences

• In triangular peg solitaire, number of distinct feasible pairs starting with one peg missing and finishing with one peg.at n=38A130515
• In triangular peg solitaire, number of distinct solvable feasible pairs starting with one peg missing and finishing with one peg.at n=38A130516
• Records in A071786.at n=43A151766
• Number of sequences of n integers p(i) i=0..n-1 with 0<=p(i)<=8*i and |p(i)-p(i-1)|<=8.at n=4A180904
• Successive integers produced by Conway's PRIMEGAME using Kilminster's Fractran program with only nine fractions.at n=21A183132
• 3*h^2, where h is an odd integer not divisible by 3.at n=30A229852
• The sum of the totatives of n is a perfect cube.at n=31A237282
• Sum of the largest parts in the partitions of 4n into 4 parts with smallest part = 1.at n=19A240711
• Odd numbers of the form (m*k)^2/(m^2-k^2) for distinct integers m and k.at n=21A259288
• Iterates of A234742, starting from value a(0) = 455, with a(1) = A234742(a(0)), a(2) = A234742(a(1)), etc.at n=2A260735
• Numbers that are the sum of three squares in arithmetic progression.at n=38A292313
• Number of chordless cycles in the complete tripartite graph K_{n,n,n}.at n=13A297662
• Smallest nonnegative number k such that k can be written in exactly n ways as x^2 + xy + y^2 where x and y are positive integers, with x >= y.at n=5A300419
• G.f. A(x) satisfies: x = Sum_{n>=1} (-1)^(n-1) * x^(2*n-1)*A(x) / (1 + x^(2*n-1)*A(x)).at n=16A303059
• Number of evolutionary duplication-loss-histories with n leaves of the caterpillar species tree with 5 leaves.at n=3A307700
• If F is the Fermat point of a triangle ABC with A < B < C < 2*Pi/3, where AB, BC, CA, FA, FB and FC are all positive integers, then, this sequence gives the sum FA + FB + FC when gcd(a, b, c) = A351477(n).at n=4A351476
• Numbers k for which A327500(k) <> A351946(k).at n=46A351947
• a(n) is the smallest nonnegative integer k where exactly n ordered pairs of positive integers (x, y) exist such that x^2 + x*y + y^2 = k.at n=9A374090
• Integers k such that k = Sum k/(p_i + j), where p_i are the prime factors of k (with multiplicity). Case j = -1.at n=8A380888
• Consecutive internal states of the linear congruential pseudo-random number generator (205*s + 29573) mod 139968 when started at 1.at n=22A383127