cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A249898 a(n+1) is next smallest square not divisible by 10 beginning with a(n), initial term is 8.

Original entry on oeis.org

8, 81, 81225, 8122515625, 812251562541751472569, 812251562541751472569881528811450814530084
Offset: 1

Views

Author

Derek Orr, Nov 08 2014

Keywords

Crossrefs

Programs

  • PARI
    a(n)=k=n; s=1; while(s<5*10^7, if(s%10, if(s^2\(10^(#Str(s^2)-#Str(k)))==k, print1(s^2, ", "); k=s^2)); s++)
    a(8)
    
  • Python
    def f(x):
      print(x, end=', ')
      n = x
      s = 1
      while s < 10**7:
        if s % 10:
          S = str(s**2)
          if S.startswith(str(n)):
            print(s**2, end=', ')
            n = s**2
        s += 1
    f(8)