32100

Appears in sequences

• n written in fractional base 4/3.at n=16A024631
• Number of 3 X n 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 0 and 1 1 1 vertically.at n=9A207896
• Numbers n = x0 x1 x2...x9 such that xi is the number of digits greater than i in n.at n=30A226195
• Indices of primes in the hexanacci numbers sequence A000383.at n=30A247192
• Underline the central digit of all terms: the underlined digits reconstruct the starting sequence. This is also true if one translates the sequence in French and underlines the central letter of each word: the underlined letters spell the (French) sequence again. This is the lexicographically earliest sequence where repeated terms are admitted.at n=53A319718
• Underline the central digit of all terms: the underlined digits reconstruct the starting sequence. This is also true if one translates the sequence in French and underlines the central letter of each word: the underlined letters spell the (French) sequence again. This is the lexicographically earliest sequence of distinct terms.at n=53A319921
• Exponential (2,3)-perfect numbers: numbers m such that esigma(esigma(m)) = 3m, where esigma(m) is the sum of exponential divisors of m (A051377).at n=29A328132
• Number of compositions of n into parts 1, 9, and 10.at n=48A368244
• a(n) is the least number x such that x^2 + 1 and 2^x + 1 are both divisible by A387595(n).at n=39A387642