login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A346270 Number of distinct solutions for the maximum value of the Gilbreath equation of an ordered sequence of n integers. 1
1, 1, 2, 6, 32, 270, 4512, 141816 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
A. M. Odlyzko, Iterated absolute values of differences of consecutive primes, Mathematics of computation, 61 (1993), 373-380.
EXAMPLE
For n=1, let the ordered sequence of integers be S = (s_1). The maximum value of the Gilbreath equation of S is k = s_1 + 1. Rewriting this as a function of s_1 gives s_1 + 1, which can take only 1 value, so a(1)=1.
For n=2, let the ordered sequence of integers be S = (s_1, s_2). The maximum value of the Gilbreath equation of S is k = s_1^1 + s2 + 1. Rewriting this as a function of s_1, s_2 gives 1 - s_1 + 2*s_2, which can take only 1 value, so a(2)=1.
For n=3, let the ordered sequence of integers be S = (s_1, s_2, s_3). The maximum value of the Gilbreath equation of S is k = s_1^2 + s_2^1 + s_3 + 1. Rewriting this as a function of s_1, s_2, s_3 gives 1 - s_2 + 2*s_3 + |s_1 - 2*s_2 + s_3|, which can take 2 distinct values, so a(3)=2.
CROSSREFS
Sequence in context: A012324 A121676 A326096 * A133596 A088437 A191691
KEYWORD
nonn,hard,more
AUTHOR
Riccardo Gatti, Jul 12 2021
EXTENSIONS
a(8) from Riccardo Gatti, Aug 29 2021
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 24 11:15 EST 2024. Contains 370303 sequences. (Running on oeis4.)