prog.sf 670 B

123456789101112131415161718192021222324252627
  1. #!/usr/bin/ruby
  2. # a(n) = largest prime divisor of A138957(n).
  3. # https://oeis.org/A138961
  4. # First several terms of the sequence:
  5. # 1, 3, 41, 617, 823, 643, 9721, 14593, 3803, 14405693, 10939223, 4156374407, 2663693, 5603770631, 1221751714624799, 287108811653770498027, 74103167823547, 11843077531813991, 726216405947772436185983423, 769725127, 18274551225153265813469
  6. # a(n) = A006530(A138957(n)). - ~~~~
  7. include("../../../factordb/auto.sf")
  8. func a(n) {
  9. 1..n -> map{.to_s.flip}.join.to_i
  10. }
  11. var bfile = File("bfile.txt").open_w.autoflush(true)
  12. for n in (1..10000) {
  13. var k = a(n)
  14. var row = "#{n} #{gpf(k)||1}"
  15. say row
  16. bfile.say(row)
  17. }
  18. __END__