26258

Appears in sequences

• Fibonacci numbers written in base 9.at n=22A004692
• a(1) = 3; a(n+1) = a(n)-th composite.at n=40A022451
• Coefficients of a polynomial used in calculation of A055913.at n=15A055916
• Football tournament numbers with distinct point totals: number of point series in A064626 in which no two teams have the same total number of points.at n=7A152789
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 329", based on the 5-celled von Neumann neighborhood.at n=34A271275
• Numbers that cannot be partitioned into two or more distinct even-valued terms or distinct odd-valued terms of the sequence.at n=39A279953
• a(n) = Fibonacci(n) represented in bijective base-9 numeration.at n=21A282240
• Coefficients in the expansion of 1/([r]-[2*r]*x+[3*r]*x^2-...); []=floor, r=3*e/5.at n=17A288232
• Coefficients in the expansion of 1/([r]-[2*r]*x+[3*r]*x^2-...); [ ]=floor, r=sqrt(8/3).at n=17A288233
• Coefficients in the expansion of 1/([r]-[2r]x+[3r]x^2-...); [ ]=floor, r=13/8.at n=17A289261
• Number of digits in the number formed by concatenating the digits of n, n+1, ..., A332584(n), or -1 if A332584(n) = -1.at n=3A332585
• G.f. A(x) satisfies: A(x) = Sum_{n>=0} x^n / (1 - x^(n+1)*A(x)^(n+1)).at n=9A340338