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.

A089582 From Gilbreath's conjecture.

This page as a plain text file.
%I A089582 #35 Feb 16 2025 08:32:51
%S A089582 2,0,2,2,2,2,2,2,0,0,0,0,0,0,2,2,0,2,2,0,0,2,2,2,0,0,0,2,2,0,2,0,0,0,
%T A089582 2,2,0,0,0,0,0,0,2,2,0,2,2,0,2,0,0,2,0,2,2,2,2,0,0,0,0,0,0,2,0,0,2,2,
%U A089582 0,0,2,2,0,2,0,0,0,0,0,2,0,2,2,2,2,2,0,0,2,2,0,0,2,2,0,0,0,0,2,2,2,2,0,0,0
%N A089582 From Gilbreath's conjecture.
%C A089582 Let d_0(n) = p_n, the n-th prime, for n = 1 and let d_k+1 (n) = | d_k(n) - d_k(n+1) | for k = 0, n = 1. A well known conjecture, usually ascribed to Gilbreath but actually due to Proth in the 19th century, says that d_k(1) = 1 for all k >= 1. This sequence gives d_k(2) for all k >1 and for the conjecture to be true, this sequence must contain only 0's and 2's. Although not necessary to the conjecture's validity, the 0's and 2's are of roughly equal count.
%C A089582 The paper cited below by A. M. Odlyzko reports on a computation that verified this conjecture for k = p(10^13) ~ 3 * 10^11. It also discusses the evidence and the heuristics about this conjecture. It is very likely that similar conjectures are also valid for many other integer sequences.
%C A089582 Number of zeros in the first 10^n terms: 3, 53, 520, 4995, 49737, 500177, ... - _Robert G. Wilson v_, Sep 29 2014
%D A089582 R. K. Guy, Unsolved Problems in Number Theory, 2nd Ed., Springer-Verlag, NY, Berlin, 1994, A10.
%D A089582 Clifford A. Pickover, The Math Book, From Pythagoras to the 57th Dimension, 250 Milestones in the History of Mathematics, Sterling Publ., NY, 2009, page 410.
%D A089582 P. Ribenboim, The new book of prime number records, 3rd edition, Springer-Verlag, New York, NY, pp. xxiv+541, ISBN 0-387-94457-5. 1995. MR 96k:11112
%H A089582 Chris Caldwell, <a href="https://t5k.org/glossary/page.php?sort=GilbreathsConjecture">The Prime Glossary, Goldbach's conjecture</a>.
%H A089582 Andrew M. Odlyzko, <a href="http://dx.doi.org/10.1090/S0025-5718-1993-1182247-7">Iterated Absolute Values of Differences of Consecutive Primes</a>, Math. Comp. 61 (1993), 373-380.
%H A089582 N. J. A. Sloane, <a href="http://neilsloane.com/doc/sg.txt">My favorite integer sequences</a>, in Sequences and their Applications (Proceedings of SETA '98).
%H A089582 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/GilbreathsConjecture.html">Gilbreath's Conjecture.</a>
%e A089582 See the triangle in A036262.
%p A089582 A089582 := proc(n)
%p A089582     A036262(n,2) ;
%p A089582 end proc:
%p A089582 seq(A089582(n),n=1..80) ; # _R. J. Mathar_, May 10 2023
%t A089582 mx = 105; lst = {}; t = Array[ Prime, mx+2]; Do[t = Abs@ Differences@ t; AppendTo[lst, t[[2]]], {n, mx}]; lst
%Y A089582 See A036262 for an abbreviated table of absolute differences.
%K A089582 easy,nonn
%O A089582 1,1
%A A089582 _Robert G. Wilson v_ and _R. K. Guy_, Nov 08 2003