100012

Appears in sequences

• Numbers written in base of triangular numbers.at n=25A000462
• Positive numbers k such that k and 2*k are anagrams of each other in base 3 (k is written here in base 3).at n=5A023058
• 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=25A037089
• Lexicographically earliest strictly increasing base 4 autovarious sequence: a(n) = number of distinct a(k) mod 4^n (written in base 4).at n=20A038113
• Lexicographically earliest strictly increasing base 5 autovarious sequence: a(n) = number of distinct a(k) mod 5^n (written in base 5).at n=15A038114
• Lexicographically earliest strictly increasing base 6 autovarious sequence: a(n) = number of distinct a(k) mod 6^n (written in base 6).at n=17A038115
• Lexicographically earliest strictly increasing base 7 autovarious sequence: a(n) = number of distinct a(k) mod 7^n (written in base 7).at n=19A038116
• Lexicographically earliest strictly increasing base 8 autovarious sequence: a(n) = number of distinct a(k) mod 8^n (written in base 8).at n=21A038117
• Lexicographically earliest strictly increasing base 9 autovarious sequence: a(n) = number of distinct a(k) mod 9^n (written in base 9).at n=23A038118
• Multiples of 4 whose digits add to 4.at n=26A063997
• Smallest k such that the concatenation 123...(k-1) k (k-1)...321 ( a concatenation of natural numbers from 1 to k and back to 1) is a multiple of prime(n), or 0 if no such number exists.at n=15A077187
• Binary numbers with 2 replacing 1 in odd positions.at n=35A095914
• 5-Smith numbers.at n=14A103126
• Smallest k such that the concatenation from 1 to k and back to 1 is divisible by 2n-1, or 0 if no such k exists.at n=26A120008
• Integers whose decimal representation consists of three distinct digits, one appearing once, one appearing twice, and one appearing three times.at n=0A182040
• Number of (n+4) X 8 0..2 matrices with each 5 X 5 subblock idempotent.at n=10A224621
• Consider a decimal number of k >= 2 digits m = d_(k)*10^(k-1) + d_(k-1)*10^(k-2) + ... + d_(2)*10 + d_(1). a(n) is the least number m such that the n-th iteration of the transform T(m) -> (d_(k) + d_(k-1) mod 10)*10^(k-1) + (d_(k-1) + d_(k-2) mod 10)*10^(k-2) + ... + (d_(2) + d_(1) mod 10)*10 + (d_(1) + d(k) mod 10) returns m, or -1 if no such number exists.at n=24A243993
• Numbers n such that sum of decimal digits of n equals number of prime divisors of n counted with multiplicity and sum of distinct decimal digits of n equals number of distinct primes dividing n.at n=13A280911
• Number x = concat(MSD(x),b) such that MSD(x)*b = d(x), where MSD(x) is the Most Significant Digit of x and d(x) is the number of divisors of x.at n=13A291618
• Minimal nonnegative integer which reaches a cycle after exactly n iterations of the modified Sisyphus function of order 5 (A375208).at n=2A383931