106763
domain: N
Appears in sequences
- a(n) = least number not of form [ (a^2/n) ] + [ (b^2)/n ].at n=35A036575
- Numerators of continued fraction convergents to Copeland-Erdos constant.at n=8A072754
- a(n) = S(n)*S(n-1), where S(n) are the generalized tribonacci numbers A001644.at n=10A073748
- a(n) = number of n-lettered words in the alphabet {1, 2, 3} with as many occurrences of the substring (consecutive subword) [1, 1, 1] as of [2, 2, 2].at n=11A211287
- Numbers k such that A000586(k) is divisible by k.at n=11A319264