100035

Appears in sequences

• Numbers k such that k and 3*k are anagrams.at n=16A023087
• Numbers n divisible by exactly four nontrivial permutations (rearrangements) of the digits of n.at n=4A090059
• Where records occur in A118878.at n=27A119904
• Half the number of length n integer sequences with sum zero and sum of squares 882.at n=4A157553
• Number of idempotent 3X3 -n..n matrices of rank 1.at n=23A221312
• a(n) = A239460(n) / n^2.at n=34A239463
• Number of nX3 0..1 arrays with every element equal to 0, 1, 2, 3, 5, 6 or 7 king-move adjacent elements, with upper left element zero.at n=7A299670
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 3, 5, 6 or 7 king-move adjacent elements, with upper left element zero.at n=47A299675
• a(n) is the index of the first occurrence of n in A331284.at n=39A331285
• Expansion of e.g.f. ( Product_{k>0} 1/(1 - (k * x)^k)^(1/k) )^exp(x).at n=5A356590
• Odd numbers k for which A003961(k) > 2*k and A003961(k)-2*k OR A003961(k)-sigma(k) = A003961(k)-2*k, where OR is bitwise-or (A003986) and A003961 is fully multiplicative with a(p) = nextprime(p).at n=9A388029
• Odd numbers k such that gcd(A276086(sigma(k)-k), A276086(k)) is equal to A276086(k), where A276086 is the primorial base exp-function, and sigma is the sum of divisors function.at n=44A388267