26475
domain: N
Appears in sequences
- Least k such that first k terms of A022300 contain n more 2's than 1's.at n=30A025515
- Numbers k such that 3^k == -1 (mod k-1).at n=14A055686
- a(n) = 9*n^3 - 18*n^2 + 10*n.at n=15A086605
- D'Agapeyeff cipher.at n=11A135209
- Numbers divisible by prime(d) for each digit d in their base-6 representation, none of which may be zero.at n=40A256876
- a(n) = a(n-1) + a(n-2) + a([(n-1)/2]), where a(0) = 1, a(1) = 2, a(2) = 3.at n=19A298353
- a(1) = 1, a(2) = 2; for n >= 3, a(n) = (n-1)^3 - a(n-1) - a(n-2).at n=42A361134