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.

A082957 Numbers n such that sigma(2n) < sigma(2n+1).

Original entry on oeis.org

1, 31, 37, 67, 73, 97, 127, 157, 199, 202, 229, 241, 247, 262, 277, 283, 307, 313, 331, 337, 346, 367, 379, 382, 397, 409, 427, 457, 472, 487, 499, 517, 547, 562, 577, 607, 619, 643, 661, 697, 727, 757, 769, 787, 823, 829, 841, 877, 892, 907, 913, 922, 937
Offset: 1

Views

Author

Benoit Cloitre, May 26 2003

Keywords

Comments

There are 2301 primes and 3169 composites among the 5470 first terms. Does limit n->infinity card(k : a(k) prime)/card(k : a(k) composite) > 0 ?

Programs

  • Maple
    q:= n-> (s-> s(2*n)Alois P. Heinz, Apr 24 2019
  • Mathematica
    Select[Range[1, 1000], DivisorSigma[1,2*#] < DivisorSigma[1,2*#+1]&] (* Vaclav Kotesovec, Feb 15 2019 *)
  • PARI
    isok(n) = sigma(2*n) < sigma(2*n+1); \\ Michel Marcus, Dec 04 2013

Formula

Conjecture : a(n) is asymptotic to c*n where 18