47915

Appears in sequences

• Losing initial positions in game: two players alternate in removing >= 1 stones; last player wins; first player may not remove all stones; each move <= 3 times previous move.at n=32A003411
• a(n) = n + (n+1)^2 + (n+2)^3.at n=34A027620
• Gaps of 6 in sequence A038593 (upper terms).at n=9A038652
• Smallest losing position after your opponent has taken k stones in a variation of "Fibonacci Nim".at n=28A054736
• a(n) = (2*n-1)*(2*n+1)^2.at n=17A102094
• Expansion of (1 - x + x^2)/(1 - x - x^4).at n=36A103632
• Row sums of a triangle related to the Fibonacci polynomials.at n=17A109222
• a(n) = n*(n+2)^2.at n=35A152619
• a(n) = 44*n^2 - 1.at n=32A158628
• a(n) = smallest number k with property that if the base-n expansion of k is reversed, the result is a nontrivial multiple of k.at n=33A224220
• a(n) = (Sum_{i=1..n-1} i^(n-2)) mod n^3.at n=36A284759
• Value of A076042 at its n-th low point.at n=17A324791
• Place two n-gons with radii 1 and 2 concentrically, forming an annular area between them. Connect all the vertices with line segments that lie entirely within that area. Then a(n) is the number of regions in that figure.at n=32A337700
• Numbers which are sum of three squares of positive numbers and also 5 times of the sum of their joint products.at n=6A347969
• Numbers k such that k and k+1 are both divisible by the square of their largest prime factor.at n=21A354558
• Numbers k such that P(k)^2 | k and P(k+1)^3 | (k+1), where P(k) = A006530(k) is the largest prime dividing k.at n=4A354563
• Numbers k such that one can make an equilateral triangle from a chain of linked rods of length 1, 2, 3, ..., k, with perimeter equal to the total length.at n=39A382632