prog.sf 312 B

1234567891011121314151617181920
  1. #!/usr/bin/ruby
  2. # Numbers n such that sigma(n) is a partition number.
  3. # https://oeis.org/A252891
  4. var arr = []
  5. for k in (1..10000) {
  6. var inv = k.partitions.inverse_sigma
  7. arr += inv
  8. if (arr.len >= 200) {
  9. arr.sort.each_kv{|k,v|
  10. say "#{k+1} #{v}"
  11. }
  12. break
  13. }
  14. }