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.

Showing 1-1 of 1 results.

A260093 Numbers n for which A259124(n) = A259124(n-1) + 1.

Original entry on oeis.org

20, 49, 2096, 5684, 14847, 440876, 18770091, 40882585915, 5598199195808, 35959924244180
Offset: 1

Views

Author

Alex Ratushnyak, Jul 15 2015

Keywords

Comments

Is the sequence infinite?
a(11) > 5 * 10^13. - Hiroaki Yamanouchi, Aug 24 2015

Crossrefs

Programs

  • PARI
    a259124(n)=sum(y=2, sqrtint(n+1)-1, my(x=(n-y)/(y+1)); if(denominator(x)==1, x+y));
    isok(n)= a259124(n) == a259124(n-1) + 1; \\ Michel Marcus, Aug 05 2015
  • Python
    TOP = 5000*5000
    a = [0]*TOP
    for y in range(2, 5000):
      z = TOP//y + 1
      for x in range(y, z):
        n = x*y + x + y
        if n>=TOP: break
        a[n] += x+y
    for n in range(1,TOP):
        if a[n]==a[n-1]+1 and a[n]>0: print(n, end=', ')
    

Extensions

a(8)-a(9) from Hiroaki Yamanouchi, Aug 24 2015
a(10) from Hiroaki Yamanouchi, Aug 25 2015
Showing 1-1 of 1 results.