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

A255770 Number of distinct prime factors of A220161(n).

Original entry on oeis.org

1, 2, 3, 4, 6, 8, 9, 11, 13, 17, 19, 21
Offset: 0

Views

Author

Hans Havermann, Mar 06 2015

Keywords

Comments

This strictly increasing sequence proves (yet again) the infinitude of primes.

Examples

			A220161(0) = 7 so a(0) = 1.
A220161(1) = 3*7 so a(1) = 2.
A220161(2) = 3*7*13 so a(2) = 3.
A220161(3) = 3*7*13*241 so a(3) = 4.
A220161(4) = 3*7*13*97*241*673 so a(4) = 6.
		

References

  • Arthur Engel, Problem-Solving Strategies, Springer, 1998, pages 121-122 (E3, said to be a "recent competition problem from the former USSR").

Crossrefs

Extensions

Offset changed by Arkadiusz Wesolowski, Aug 01 2016

A220294 a(n) = 1 - 2^(2^n) + 2^(2^(n+1)).

Original entry on oeis.org

3, 13, 241, 65281, 4294901761, 18446744069414584321, 340282366920938463444927863358058659841, 115792089237316195423570985008687907852929702298719625575994209400481361428481
Offset: 0

Views

Author

Michael Somos, Dec 10 2012

Keywords

Comments

An infinite coprime sequence defined by recursion.

Crossrefs

Programs

  • Magma
    [1 - 2^(2^n) + 2^(2^(n+1)): n in [0..10]]; // G. C. Greubel, Aug 10 2018
  • Mathematica
    Table[4^(2^m) - 2^(2^m) + 1, {m, 0, 7}] (* Michael De Vlieger, Aug 02 2016 *)
  • Maxima
    A220294(n):=1 - 2^(2^n) + 2^(2^(n+1))$ makelist(A220294(n),n,0,10); /* Martin Ettl, Dec 10 2012 */
    
  • PARI
    {a(n) = if( n<0, 0, 1 - 2^(2^n) + 2^(2^(n+1)))};
    

Formula

A220161(n+1) = a(n) * A220161(n).
a(n+1) = 1 + (a(n) - 1) * (A220161(n) - 1).
a(n) = A002716(2*n) = 1 + A087046(n+2) = 1 + A111403(n).
a(n) = A002061(A001146(n)). - Pontus von Brömssen, Aug 31 2021

A255772 Start with 7; thereafter, in order of appearance, the prime factors of A220294.

Original entry on oeis.org

7, 3, 13, 241, 97, 673, 193, 22253377, 18446744069414584321, 769, 442499826945303593556473164314770689, 349621839326921795694385454593, 331192380488114152600457428497953408512758882817, 212780015855109121
Offset: 1

Views

Author

Hans Havermann, Mar 06 2015

Keywords

Comments

A220161(n-1) = the product of the first A255770(n) terms.

References

  • Arthur Engel, Problem-Solving Strategies, Springer, 1998, pages 121-122 (E3, said to be a "recent competition problem from the former USSR").

Crossrefs

A255771 Number of distinct prime factors of A220294(n).

Original entry on oeis.org

1, 1, 1, 2, 2, 1, 2, 2, 4, 2, 2
Offset: 0

Views

Author

Hans Havermann, Mar 06 2015

Keywords

Comments

These are the first differences of A255770.

Examples

			A220294(0) = 3 so a(0) = 1.
A220294(1) = 13 so a(1) = 1.
A220294(2) = 241 so a(2) = 1.
A220294(3) = 97*673 so a(3) = 2.
A220294(4) = 193*22253377 so a(4) = 2.
		

References

  • Arthur Engel, Problem-Solving Strategies, Springer, 1998, pages 121-122 (E3, said to be a "recent competition problem from the former USSR").

Crossrefs

Extensions

Offset changed by Arkadiusz Wesolowski, Aug 01 2016
a(9) was found in 2008 by Geoffrey Reynolds. a(10) was found by Anders Björn and Hans Riesel. - Arkadiusz Wesolowski, Aug 02 2016
Showing 1-4 of 4 results.