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.

A053230 First differences between numbers k for which sigma(k) < sigma(k+1).

Original entry on oeis.org

1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 2, 2, 2, 2, 2, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 4, 2, 2, 2, 2, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 2, 2, 2, 2, 2, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 2, 2, 2, 2, 2, 2
Offset: 1

Views

Author

Asher Auel, Jan 10 2000

Keywords

Comments

It seems that the expansion consists of only {1,2,3,4}.
The first exception is a(10010491) = 6, corresponding to the gap from 20021153 to 20021159. - Charles R Greathouse IV, Mar 09 2014
The asymptotic mean of this sequence is 2 (Erdős, 1936). - Amiram Eldar, Mar 19 2021

Crossrefs

Programs

  • Haskell
    a053230 n = a053230_list !! (n-1)
    a053230_list = zipWith (-) (tail a053224_list) a053224_list
    -- Reinhard Zumkeller, May 07 2012
    
  • Maple
    with(numtheory): f := [seq( `if`((sigma(i+1) > sigma(i)),i,print( )), i=1..5000)];
    seq( f[i+1] - f[i], i=1..2000);
  • Mathematica
    Differences[Select[Range[250],DivisorSigma[1,#]Harvey P. Dale, Apr 30 2011 *)
  • PARI
    last=ls=1; for(n=2,200,ns=sigma(n+1); if(ls>=ns,ls=ns; next); ls=ns; print1(n-last", ");last=n) \\ Charles R Greathouse IV, Mar 09 2014

Formula

a(n) = A053224(n+1) - A053224(n).