106288

Appears in sequences

• a(n) is least k such that k and 2k are anagrams in base n (written in base 10).at n=24A023094
• Number of ternary Lyndon words of length n with trace 1 and subtrace 0 over GF(3). Same as the number of ternary Lyndon words of length n with trace 2 and subtrace 0 over GF(3).at n=14A053562
• Number of ternary Lyndon words of length n with trace 1 and subtrace 1 over GF(3). Same as the number of ternary Lyndon words of length n with trace 2 and subtrace 1 over GF(3).at n=14A053563
• Number of ternary Lyndon words of length n with trace 1 and subtrace 2 over GF(3). Same as the number of ternary Lyndon words of length n with trace 2 and subtrace 2 over GF(3).at n=14A053564
• a(n) = 14 + floor( (1 + Sum_{j=0..n-1} a(j)) / 2).at n=22A120141
• Number of black-square subarrays of (n+2) X (2+2) 0..3 arrays x(i,j) with each element diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 4, no adjacent elements equal, and upper left element zero.at n=10A230929
• Total number of parts in all overcompositions of n.at n=12A236625
• a(0) = 0, a(n) = Sum_{0<d|n, n/d odd} d^4 for n > 0.at n=18A285989
• Numbers k such that (3^ord(3, k) - 1)/k is prime, where ord(3, k) is the multiplicative order of 3 (mod k).at n=35A297363
• Sum of the 4th powers of the divisor complements of the odd proper divisors of n.at n=17A352050
• Numbers that are palindromes in both ternary and balanced ternary representations with representations that are different.at n=15A354886
• a(n) = round(3^n/5).at n=12A383324