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!)
A293348 Number of distinguishable configurations of the nearest larger value problem on an array of size n, using tiebreaking rule III: ties are broken by using the larger value. 2
1, 1, 2, 5, 12, 32, 88, 248, 702, 1998, 5696, 16304, 46718 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,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: A345200 A173611 A292211 * A188287 A363240 A148281
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 April 19 07:38 EDT 2024. Contains 371782 sequences. (Running on oeis4.)