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!)
A327461 Maximal size of a Binary Decision Diagram (or BDD) of index n. 2
3, 5, 7, 11, 19, 31, 47, 79, 143, 271, 511, 767, 1279, 2303, 4351, 8447, 16639, 33023, 65791, 131071, 196607, 327679, 589823, 1114111, 2162687, 4259839, 8454143, 16842751, 33619967, 67174399, 134283263, 268500991, 536936447, 1073807359, 2147549183, 4295032831 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

REFERENCES

D. E. Knuth, The Art of Computer Programming, Volume 4A, Combinatorial Algorithms. Addison-Wesley Professional, 2011. See Section 7.1.4, Theorem U, page 234.

LINKS

Pontus von Brömssen, Table of n, a(n) for n = 1..1024

Julien Clément, Antoine Genitrini, Binary Decision Diagrams: from Tree Compaction to Sampling, arXiv:1907.06743 [cs.DS], 2019. See Section 6.1, especially Fact 24. (This section appears only in version 1 of the paper.)

FORMULA

a(n) = 2^(n - A284248(n)) + 2^2^A284248(n) - 1. - Pontus von Brömssen, Apr 08 2020

PROG

(Python)

def A327461(n):

  return 2**(n-(n-n.bit_length()+1).bit_length()+1)+2**2**((n-n.bit_length()+1).bit_length()-1)-1 # Pontus von Brömssen, Apr 08 2020

CROSSREFS

Cf. A284248.

Sequence in context: A155008 A175196 A077858 * A126116 A161423 A133846

Adjacent sequences:  A327458 A327459 A327460 * A327462 A327463 A327464

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Sep 26 2019

EXTENSIONS

More terms from Pontus von Brömssen, Apr 08 2020

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 September 28 06:22 EDT 2022. Contains 357063 sequences. (Running on oeis4.)