31851

Appears in sequences

• Number of n-node trees of height at most 4.at n=16A001384
• Fibonacci sequence beginning 1, 7.at n=19A022097
• Main diagonal of the Stolarsky array.at n=14A035489
• Expansion of g.f. (7+6*x-6*x^2-3*x^3)/((x^2+x-1)*(x^2-x-1)).at n=18A099255
• G.f.: 1/((1-x)*(1-x^2)*(1-x^3)*(1-x^4)*(1-x^5))^2.at n=24A117487
• A triangular array distributing the values of sequence A072213 (cf. A115994).at n=25A128626
• Square table, read by antidiagonals, where row e.g.f.s, R(n,x), satisfy: d/dx log( R(n,x) )/n = R(n+1,x) with R(n,0) = 1; that is, the logarithmic derivative of the e.g.f. of row n, divided by n, equals the e.g.f. of row n+1, for n>=1.at n=27A145080
• Row 1 of square table A145080; also equals row 1 of square table A145085.at n=6A145081
• Square table, read by antidiagonals, where row e.g.f.s, R(n,x), satisfy: d/dx log( R(n,x) ) = R(n+1,x)^(n+1) with R(n,0) = 1; that is, the logarithmic derivative of the e.g.f. of row n equals the e.g.f. of row n+1 to the n+1 power, for n>=0.at n=34A145085
• a(n) = 26*n^2 + 1.at n=35A158549
• Sequence related to Kashaev's invariant for the (5,2)-torus knot.at n=7A208733
• a(n) = prime(n)^3 mod (n^2 + prime(n)^2).at n=49A243769
• Number of nX3 0..1 arrays with every element equal to 0, 3, 4, 5 or 8 king-move adjacent elements, with upper left element zero.at n=23A298777
• Sum of the second largest parts of the partitions of n into 10 parts.at n=41A326597
• Triangle read by rows: T(n,k) is the number of parking functions of length n with k strict descents. T(n,k) for n >= 1 and 0 <= k <= n-1.at n=25A333829