55755

Appears in sequences

• Expansion of e.g.f.: sin(log(x+1) - sin(x)) = -1/2!*x^2+3/3!*x^3-6/4!*x^4+23/5!*x^5...at n=10A013210
• Expansion of 1/((1-2x)(1-3x)(1-4x)(1-6x)).at n=5A025440
• Palindromes with exactly 6 prime factors (counted with multiplicity).at n=30A046332
• Palindromes n such that n and n^2 have same digit sum.at n=14A058852
• Schroeder pseudoprimes: Composites k that divide the k-th Schroeder number A001003(k-1).at n=35A075764
• Palindromes in A082939.at n=31A082940
• Triangle read by rows giving the coefficients of general sum formulas of n-th Fibonacci numbers (A000045). The k-th row (k>=1) contains T(i,k) for i=1 to 2*k-1, where T(i,k) satisfies F(n) = Sum_{k=1..n} Sum_{i=1..2*k-1} T(i,k) * C(n-k,i-1) * n^(n-k) / (n-1)!.at n=23A100492
• Triangle read by rows: T(n, m) = number of forests with n nodes and m labeled trees. Also number of forests with exactly n - m edges on n labeled nodes.at n=40A105599
• Lee weight enumerator of a certain code over GF(4).at n=8A105925
• Triangle read by rows: T(n, k) is the number of forests on n labeled nodes with k edges. T(n, k) for n >= 1 and 0 <= k <= n-1.at n=40A138464
• Expansion of 1/(1 + x - x^2 - 3*x^3 - x^4 + x^5 + x^6).at n=43A147592
• Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k increasing even cycles (0<=k<=n). A cycle (b(1), b(2), ...) is said to be increasing if, when written with its smallest element in the first position, it satisfies b(1)<b(2)<b(3)<... . A cycle is said to be even if it has an even number of entries. For example, the permutation (18)(2347)(569) has 2 increasing even cycles.at n=33A186764
• Number of forests with n labeled nodes and 5 trees.at n=4A240682
• Palindromes in base 10 that are also palindromes in base 60.at n=17A262069
• Numbers k with digits 5 and 7 only.at n=34A284380
• Sum of all the parts in the partitions of n into 9 squarefree parts.at n=45A326523
• a(n) = 5*(10^(2*n+1)-1)/9 + 2*10^n.at n=2A332157