28670

Appears in sequences

• Molien series for A_9.at n=46A008632
• a(n) = Sum_{k=0..n} A026615(n, k).at n=14A026622
• Divide natural numbers in groups with prime(n) elements and add together.at n=17A034957
• a(n) = prime(n) * Fibonacci(n).at n=14A064497
• 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, 0), (-1, 0, 0), (-1, 0, 1), (0, 1, -1), (1, 0, 1)}.at n=9A149321
• a(0)=1, a(1)=2, a(2)=1; for n>2, a(n) = 7*2^(n-3)-2.at n=15A174317
• a(n) = 7*2^n - 2.at n=12A176448
• Number of permutations of 1..n+5 with the number moved left exceeding the number moved right by n or more.at n=6A179580
• First occurrence of n in A220115.at n=11A220117
• Number of partitions of n such that the number of even parts is a part and the number of odd parts is not a part.at n=45A240577
• a(n) is the smallest even number not congruent to 1 modulo 3 that starts a (2n+1)-element alternating sequence of x/2 and (3x+1) iterations ending in the maximum of its Collatz trajectory.at n=11A277215
• Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 601", based on the 5-celled von Neumann neighborhood.at n=14A283221
• a(n) = 5*(3*n+1)*(9*n+8)/2 (n>=0).at n=20A304508
• a(n) - 2*a(n-1) = period 2: repeat [3, 0] for n > 0, a(0)=5, a(1)=13.at n=12A322417
• Sum of distinct products i*j*k with 1 <= i, j, k <= n.at n=9A323334
• Number of acyclic edge covers of the complete bipartite graph K_{n,2}.at n=11A328890