a(n) is the smallest positive integer which is expressed by the greedy algorithm as the sum of exactly n prime-powers (including 1).
A336825
a(n) is the smallest positive integer which is expressed by the greedy algorithm as the sum of exactly n prime-powers (including 1).
Terms
- a(0) =1a(1) =6a(2) =95a(3) =360748
External references
- oeis: A336825