24299

Appears in sequences

• Number of 3's in n-th term of A006711.at n=41A022479
• Discriminants of quintic fields with 2 complex conjugates (negated).at n=49A023684
• Let R(i,j) be the rectangle with antidiagonals 1; 2,3; 4,5,6; ...; each k is an R(i(k),j(k)) and A057041(n)=j(F(n)), where F(n) is the n-th Fibonacci number.at n=42A057041
• Expansion of (7 +4*x -5*x^2 -7*x^3) / ((1-x)*(1-x^2-x^3)).at n=29A103485
• Numbers k such that k^3 contains a pandigital substring.at n=22A115933
• a(n) = prime(n) * prime(n+2) - 2 * prime(n+1).at n=35A152532
• a(n) = 900*n - 1.at n=26A158409
• Sequence A190914 evaluated at the negative index -n.at n=21A190913
• Smallest integer m > n such that both n*m and (n+1)*(m+1) are squares.at n=11A212651
• Values for b in abc-triples with a=1.at n=37A216323
• Number of button presses required to try every combination of a binary combination lock with n number buttons.at n=12A247374
• Number of set partitions C'_t(n) of {1,2,...,t} into at most n parts, with an even number of elements in each part distinguished by marks and such that no part contains both 1 and t (each unmarked) or both i and i+1 (each unmarked) for some i with 1 <= i < t; triangle C'_t(n), t>=0, 0<=n<=t, read by rows.at n=41A261319
• Array read by antidiagonals: A(n,k) is the number of unsensed planar maps with n vertices and k faces, n >= 1, k >= 1.at n=47A277741
• Array read by antidiagonals: A(n,k) is the number of unsensed planar maps with n vertices and k faces, n >= 1, k >= 1.at n=52A277741
• Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 397", based on the 5-celled von Neumann neighborhood.at n=28A281754
• a(n) = n * (4*n + 3)^2.at n=11A322675
• Numbers k such that k and k+1 are both divisible by the square of their largest prime factor.at n=18A354558
• a(n+1) = 2*a(n) + A298338(n-1), with a(1) = 1.at n=13A363503
• Numbers k such that sigma(k) = psi(k) + 2 * tau(k).at n=35A387962