100032

Appears in sequences

• Positive numbers k such that k and 2*k are anagrams in base 4 (written in base 4).at n=36A023059
• Positive numbers k such that k and 3*k are anagrams in base 5 (written in base 5).at n=12A023062
• Lexicographically earliest strictly increasing decimal autovarious sequence: a(n) = number of distinct n-digit endings (left-zero-padded) of terms in the sequence.at n=29A037089
• Lexicographically earliest strictly increasing base 9 autovarious sequence: a(n) = number of distinct a(k) mod 9^n (written in base 9).at n=27A038118
• Smallest n-digit number divisible by 2^n.at n=5A050621
• Triangle read by rows: n-th row contains the first n n-digit multiples of n with digit sum n. If there are fewer than n such numbers, the rest of the row is filled with 0's.at n=16A084029
• a(n) = Sum_{0<d|n, n/d odd} d^5.at n=9A096960
• Let x(0)x(1)x(2)... x(q) denote the decimal expansion of n. Sequence lists the numbers n such that the suffix of decimal expansion x(2)... x(q) is the p-th divisor of n where p is the prefix of decimal expansion x(0)x(1).at n=13A234315
• a(n) = A239460(n) / n^2.at n=31A239463
• Numbers <= 10^6 with valid Luhn mod 10 check digit, sorted lexicographically.at n=4A249854
• a(n) = n + (n base 2 regarded as a decimal number).at n=32A269130
• Expansion of 1/(1 - Sum_{k>=0} x^(2*k*(k+1)+1)).at n=42A282504
• Expansion of eta(q^2)^12 * eta(q^4)^8 / eta(q)^8 in powers of q.at n=20A286399
• a(n) = Sum_{d|n, n/d==1 mod 4} d^5 - Sum_{d|n, n/d==3 mod 4} d^5.at n=9A321829
• Sum of the 5th powers of the divisor complements of the odd proper divisors of n.at n=9A352051