26019

Appears in sequences

• a(1)=1, a(2)=2, a(3)=3; for n >= 3, a(n) is smallest number such that all a(i) for 1 <= i <= n are distinct, all a(i)+a(j) for 1 <= i < j <= n are distinct and all a(i)+a(j)+a(k) for 1 <= i < j < k <= n are distinct.at n=26A036241
• a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 2 - 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=34A050043
• Numbers n such that n | 10^n + 9^n + 8^n + 7^n + 6^n + 5^n + 4^n + 3^n + 2^n.at n=43A057287
• Number of partitions of n plus number of divisors of n.at n=37A195364
• Numbers x such that the sum of all their cyclic permutations is equal to that of all cyclic permutations of sigma(x) and all cyclic permutations of Euler totient function phi(x).at n=29A247317
• Number of vertices in regular n-gon after 2 generations of mitosis.at n=18A349967
• a(n) = number of isogeny classes of abelian surfaces over the finite field of order prime(n).at n=41A362198