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!)
A255399 a(n) is the number of optimal rules (partitions) for A241216(n). 2
1, 1, 1, 1, 2, 2, 2, 1, 6, 1, 6, 5, 6, 5, 3, 5, 24, 2, 3, 2, 27, 2, 25, 23, 29, 26, 17, 1, 13, 22, 22, 18, 6, 19, 7, 9, 11, 10, 4, 15, 1, 9, 8, 6, 173, 10, 158, 4, 184, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,5
LINKS
CROSSREFS
Cf. A255394: numbers n such that a(n) = 1.
Sequence in context: A114293 A295691 A285183 * A181830 A352736 A086612
KEYWORD
nonn,hard,more
AUTHOR
Joerg Arndt, Feb 22 2015
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 24 11:49 EDT 2024. Contains 371936 sequences. (Running on oeis4.)