The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A293347 Number of distinguishable configurations of the nearest larger value problem on an array of size n, using tiebreaking rule II: ties are broken by using the smaller value. 2
1, 1, 2, 5, 14, 42, 126, 383, 1178, 3640, 11316, 35263, 110376 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
Michael Hoffmann, John Iacono, Patrick K. Nicholson, Rajeev Raman, Encoding nearest larger values, Theoretical Computer Science 710 (2018), 97-115.
CROSSREFS
Sequence in context: A298367 A025274 A132833 * A148326 A148327 A092493
KEYWORD
nonn,more
AUTHOR
Eric M. Schmidt, Oct 07 2017
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 May 27 12:12 EDT 2024. Contains 372858 sequences. (Running on oeis4.)