39208

Appears in sequences

• Schroeder's fourth problem; also series-reduced rooted trees with n labeled leaves; also number of total partitions of n.at n=7A000311
• Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 99.at n=37A031597
• Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 99.at n=1A031777
• a(n) = (2*6^n - (5^n - 3^n))/2.at n=6A083316
• 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, 1), (-1, 1, -1), (0, 0, 1), (0, 1, 1), (1, 0, 0)}.at n=8A151044
• Numbers n such that phi(phi(n)) + sigma(sigma(n))=6*n.at n=3A246630
• Irregular triangular array: row n lists the numbers D, each being the discriminant of the minimal polynomial of a quadratic irrational represented by a continued fraction with period an n-tuple of 1s and 2s.at n=50A246903
• Triangle read by rows: number of generic n-rook placements with k rooks below the main diagonal.at n=15A269744
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 121", based on the 5-celled von Neumann neighborhood.at n=38A270208
• Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 395", based on the 5-celled von Neumann neighborhood.at n=36A287985
• Inverse matrix of A135494.at n=21A298673
• Triangle read by rows: T(n,k) is the number of lone-child-avoiding rooted trees with n leaves of exactly k colors.at n=27A319376
• Triangle read by rows: T(n,k) is the number of homeomorphically irreducible leaf colored trees with n leaves using exactly k colors.at n=44A339780
• Table read by descending antidiagonals. T(n,k) is the big Ramsey degree of k in w^n, where w is the first transfinite ordinal, omega.at n=38A364026