53124

Appears in sequences

• a(n) = a(n-1) + a(n-3), with a(0) = a(1) = 1, a(2) = 5.at n=27A011761
• Alternately append n to end or beginning of previous term.at n=4A053064
• G.f.: A(x) = exp( Sum_{n>=1} 3*A038500(n) * x^n/n ), where A038500 is the highest power of 3 dividing n.at n=42A161809
• a(n) = (n+6)*(n+1)*(n^2 + 7*n + 16)/4.at n=19A168538
• The number of unlabeled graphs on n nodes with degree of 1 or 2.at n=35A186417
• a(n) = 3*(9*n - 1)*(3*n - 2).at n=26A277985
• Concatenate the decimal numbers n n-2 n-4 ...5 3 1 2 4 ... n-5 n-3 n-1 if n is odd, or n n-2 n-4 ... 6 4 2 1 3 5 ... n-5 n-3 n-1 if n is even.at n=4A281254
• Deep factorization of n, A300560, converted from binary to decimal. (Binary digits obtained by recursively replacing each factor p^e with [primepi(p) [e]], then '[' = 1, ']' = 0.)at n=13A300561
• Decimal representation of permutations of lengths 1, 2, 3, ...at n=31A306428