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.

A275370 Odd numbers n such that sigma(n) = sigma(2*n-1).

Original entry on oeis.org

1, 13545, 57645, 116865, 1440495, 7029855, 8596455, 27361125, 41100345, 48289185, 56122185, 77560065, 103225185, 134813385, 146591235, 163817745, 188358885, 198748305, 242668335, 269436375, 352094715, 358841385, 535135965, 563911335, 636719265, 712457655, 724692045
Offset: 1

Views

Author

Altug Alkan, Jul 25 2016

Keywords

Comments

The smallest term that is not divisible by 5 is 1577106531.

Examples

			The numbers n that solve sigma(n) = sigma(2n-1) are n = 1, 6, 348, 496, 1420, 1854, 4647, 5352, 6424, 13545, 21126,... The sequence selects the odd members.
		

Crossrefs

Programs

  • PARI
    isok(n) = sigma(n) == sigma(2*n-1) && n % 2 == 1