16515072

Appears in sequences

• a(n) = 8^n-n^6.at n=8A024094
• Triangle whose (i,j)-th entry is binomial(i,j)*8^(i-j)*9^j.at n=29A038287
• Totient of 2^n+1.at n=24A053285
• Number of divisors of k as k runs through sequence of distinct values of LCM(1,..,n).at n=29A056795
• S(n; 1,0) = S(n; 3,0) where S(n; t,s) is the number of length n 4-ary strings whose digits sum to t mod 4 and whose sum of products of all pairs of digits sum to s mod 4.at n=13A068786
• Number of strings over Z_4 of length n with trace 1 and subtrace 2.at n=13A068787
• Jordan function J_6(n).at n=15A069091
• a(1) = 1; a(n) is the smallest multiple of a(n-1) not divisible by 10 which is greater than the digit reversal of a(n-1). In case R(a(n-1)) < a(n-1) then a(n) = 2*a(n-1).at n=18A076086
• Binomial transform of A001651.at n=20A084858
• Row sums of triangle A128182.at n=19A128183
• Number of divisors of A138113(n).at n=32A140410
• Triangular array read by rows. T(n,k) is the number of rooted labeled trees on n nodes such that the root node has degree k. n>=2, 1<=k<=n-1.at n=29A206429
• Number of solutions to Sum_{i=1..n} x_i^2 == 0 (mod 4) with x_i in 0..3.at n=12A228920
• Number of solutions to Sum_{i=1..n} x_i^2 == 1 (mod 4) with x_i in 0..3.at n=12A229136
• Number of n X 2 0..2 arrays with some element plus some horizontally or antidiagonally adjacent neighbor totalling two not more than once.at n=9A268965
• a(n) is the number of numbers whose largest prime power factor equals A000961(n).at n=30A305215
• a(n) is the number of numbers whose largest prime power factor equals A000961(n).at n=32A305215
• Numbers that can be written in two or more ways as the product of three divisors greater than 1 such that the number in binary is contained in the string concatenation of the divisors in binary.at n=32A356143
• Optimal link functions for repeat avoidance in double elimination tournaments.at n=23A356189
• a(n) = phi(4^n+1), where phi is Euler's totient function (A000010).at n=12A366608