25630

Appears in sequences

• Positive numbers k such that k and 2*k are anagrams in base 9 (written in base 9).at n=36A023079
• Number of 6's in all partitions of n.at n=41A024790
• Sum of remainders when n-th Fibonacci number is divided by all smaller Fibonacci numbers > 1.at n=22A072523
• a(n) = number of partitions of n wherein the sum of the 1's is no more than the sum of the other parts.at n=37A083690
• a(1)=1, a(n+1)=ceiling(phi*a(n))+1 if a(n) is odd, a(n+1)=ceiling(phi*a(n)) if a(n) is even, where phi=(1+sqrt(5))/2.at n=19A092263
• Expansion of 2*x^2*(3-x)/((1+x)*(1-3*x+x^2)).at n=10A121801
• Number of 4-bead necklaces labeled with numbers -n..n allowing reversal, with sum zero with no three beads in a row equal.at n=32A209345
• Number of partitions of 2*n into parts with multiplicity <= n.at n=19A232623
• Triangle read by rows: number of (1-2-3)-avoiding permutations on n letters with k peaks.at n=34A236406
• Number of (n+1) X (3+1) 0..1 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction.at n=10A250764
• Expansion of e.g.f. exp(Sum_{k>=1} mu(k)*x^k/k!), where mu() is the Moebius function (A008683).at n=11A300673
• a(n) = number of subsets of {1, 2, ..., n} that represent the first k divisors of m for some positive integers m and 1 <= k <= A000005(m).at n=32A378314