28611
domain: N
Appears in sequences
- a(n) is least k such that k and 6k are anagrams in base n (written in base 10).at n=5A023098
- a(n) = T(n,n-3), where T is the array in A026148.at n=9A026154
- Numbers k such that 7*10^k + 6*R_k + 3 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=27A103065
- Integers of the form "partial sum of the first k nonprimes divided by the k-th nonprime.".at n=7A165239
- Ordered (2,2)-selections from the multiset {1,1,2,2,3,3,...,n,n}.at n=18A188667
- Number of partitions of n such that (greatest part) - (least part) < number of parts.at n=41A237830
- Number of partitions of n, where the difference between the number of odd parts and the number of even parts is 8.at n=50A240017
- Number of balanced ternary words of length n.at n=30A260938
- Numbers k such that k = rad(k) * sopfr(k), where rad(k) is the squarefree kernel of k and sopfr(k) the integer log of k.at n=16A280935
- a(n) is the number of integers k in range [2^n, (2^(n+1))-1] such that all terms in finite sequence [k, floor(k/2), floor(k/4), floor(k/8), ..., 1] are squarefree.at n=33A293230
- Number of integer compositions of n with no ones or runs of length 1.at n=45A353508