25150

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=30A003411
• a(n) is the concatenation of n and 6n.at n=24A009440
• Triangular array associated with Schroeder numbers.at n=51A033878
• Numerators of continued fraction convergents to sqrt(280).at n=8A041526
• Smallest losing position after your opponent has taken k stones in a variation of "Fibonacci Nim".at n=26A054736
• Numbers k such that 1000k+1, 1000k+3, 1000k+7, 1000k+9 are all primes.at n=12A064962
• Inverse of the Delannoy triangle.at n=48A103136
• Expansion of (1 - x + x^2)/(1 - x - x^4).at n=34A103632
• Row sums of a triangle related to the Fibonacci polynomials.at n=16A109222
• Riordan array ((1-x+sqrt(1+6*x+x^2))/2, (sqrt(1+6*x+x^2)-x-1)/2).at n=59A112477
• T(n, k) counts Schroeder n-paths whose ascent starting at the initial vertex has length k. Triangle T(n,k), read by rows.at n=48A132372
• A007318^2 * A007248.at n=10A134443
• Derived from the centered polygonal numbers: start with the first triangular number, then the sum of the first square number and the second triangular number, then the sum of first pentagonal number, the second square number and the third triangular number, and so on and so on...at n=25A141534
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, -1), (0, 0, -1), (1, 0, 1), (1, 1, 0)}.at n=8A150353
• Number of ordered 10-tuples of distinct pairwise coprime positive integers with largest element n.at n=18A186981
• Number of 9-element subsets of {1, 2, ..., n} having pairwise coprime elements.at n=21A186985
• Number of (n+1) X (n+1) 0..1 matrices with each 2 X 2 subblock idempotent.at n=10A224543
• Largest order of a rooted tree that does not contain a rooted caterpillar subtree of order n.at n=27A253062
• Convolution of A006068 (inverse of Gray code) with itself: a(n) = Sum_{k=1..n+1} A006068(k) * A006068(1+n-k).at n=47A268721
• Number of toroidal necklaces of positive integers summing to n.at n=17A323858