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.

Previous Showing 31-33 of 33 results.

A127495 Found on geocaching.com, can't find the answer.

Original entry on oeis.org

23, 28, 43, 65, 98
Offset: 1

Views

Author

GB (sextant11(AT)hotmail.com), Oct 10 2007

Keywords

Formula

It appears that a(n+1)=a(n)+sum_{i=1..n}A007953(a(i)). - R. J. Mathar, Oct 14 2007

A133260 Unknown.

Original entry on oeis.org

20, 22, 30, 44, 66, 94
Offset: 1

Views

Author

kidon (kidonoscar(AT)hotmail.com), Oct 15 2007

Keywords

Comments

Possible solution: a(1) = 20 and a(n) = a(n-1) + 2 * A078309(n-1) for n >=2 , giving 20, 22, 30, 44, 66, 94, 128, 170, 218, 272, 334, 402, 476, 558, 646, 740, 842, ... . - Michal Paulovic, Nov 05 2023

Crossrefs

Cf. A078309.

A147513 Numbers such that the n-th and (n+1)st terms are the successors of prime numbers and primes themselves and n+1 > n.

Original entry on oeis.org

3, 5, 7, 11, 13, 19, 23, 31, 37, 47
Offset: 1

Views

Author

Jonathan Baca (jbakid(AT)gmail.com), Nov 05 2008

Keywords

Comments

Is this the same as prime(k) such that prime(k+1)*prime(k+2) > 1 + prime(k)*prime(k+3)? - Arkadiusz Wesolowski, May 12 2018
a(n) = A075323(n) for 1 <= n <= 10. - Georg Fischer, Nov 02 2018

Crossrefs

Cf. A075323.
Previous Showing 31-33 of 33 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.