62498

Appears in sequences

• a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2, and a(3) = 1.at n=18A049900
• First differences of A087404: a(n) = A087404(n) - A087404(n-1), a(0) = A087404(0).at n=7A087405
• Smallest number k containing no zero digit such that k^2 contains exactly n zeros.at n=5A134846
• a(n) = smallest number with n+1 digits and without zero digits whose squares have the maximal number of zero digits = A135215(n+1).at n=3A135217
• a(n) = largest number with n+1 digits and without zero digits whose squares have maximal number of zero digits = A135215(n+1).at n=3A135219
• Numbers, a(n) where binomial(a(n), 5n-1) == 0 (mod 5) and binomial(a(n), k) != 0 (mod 5) for k != 5n - 1.at n=22A224251
• Numbers m such that antisigma(m) contains sigma(m) as a substring.at n=9A258413
• Number of nX4 0..1 arrays with no element equal to more than one of its horizontal and vertical neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=16A280436
• Number of palindromic plane trees with n nodes.at n=19A319436
• G.f.: Sum_{n>=0} (2^n + 1)^n * x^n / (1 + 2^n*x)^(n+1).at n=4A324306