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.

A096823 a(n) = p*(p+(2n-1))/2, where p = A096822(n) is the smallest primes of form 2^x-(2n-1).

Original entry on oeis.org

6, 20, 12, 151115727449904501489664, 56, 40, 24, 272, 1504, 208, 176, 1312, 112, 80, 48, 6208, 992, 928, 2059264, 5696, 736, 144115176533131264, 608, 544, 5056, 416, 352, 4672, 224, 160, 96, 24704, 24448, 3904, 3776, 487936, 112384, 3392, 22912
Offset: 1

Views

Author

Labos Elemer, Jul 13 2004

Keywords

Comments

These numbers are clearly analogous to perfect numbers.
sigma(a(n)) mod a(n) = 2*n.

Examples

			a(1) = 6 is the first even perfect number;
a(7) = 24 corresponds to A096821(1) = 24;
a(4) = 151115727449904501489664 = 2^38*(2^39-7) = 274877906944*549755813881;
		

Crossrefs

Extensions

Edited by Max Alekseyev, May 29 2025