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-2 of 2 results.

A139224 M(M-1)/2, where M is Mersenne prime A000668(n).

Original entry on oeis.org

3, 21, 465, 8001, 33542145, 8589737985, 137438167041, 2305843005992468481, 2658455991569831742348849606740148225, 191561942608236107294793377465333618488307184098607105
Offset: 1

Views

Author

Omar E. Pol, May 10 2008

Keywords

Comments

Perfect number A000396(n) minus Mersenne prime A000668(n).

Links

Crossrefs

Cf. A000217, A000396, A000668, A036689, A139096, A139115, A139116, A139223, A139225, A139226, A139256, A139306.

Formula

a(n) = A000668(n)*(A000668(n)-1)/2.
a(n) = A000396(n)-A000668(n).

Extensions

More terms from Max Alekseyev, Mar 09 2009

A139226 M(M-1)/6, where M is Mersenne prime A000668(n).

Original entry on oeis.org

1, 7, 155, 2667, 11180715, 2863245995, 45812722347, 768614335330822827, 886151997189943914116283202246716075, 63853980869412035764931125821777872829435728032869035, 4388012152856549445746584486819520216982214368341183846591146667, 4824670384888174809315457708695329493801178769338122219111555681805105015467
Offset: 1

Views

Author

Omar E. Pol, May 10 2008

Keywords

Comments

Perfect number A000396(n) minus Mersenne prime A000668(n), divided by 3.
Terms from a(13) on have 313 or more digits and are not listed for that reason. - R. J. Mathar, May 11 2008

Links

Crossrefs

Cf. A000217, A000396, A000668, A036689, A139096, A139115, A139116, A139223, A139224, A139225, A139256, A139306.

Formula

a(n) = A000668(n)*(A000668(n)-1)/6 = A139223(n)/6 = A139224(n)/3.
a(n) = (A000396(n)-A000668(n))/3.

Extensions

More terms from R. J. Mathar, May 11 2008
Showing 1-2 of 2 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.