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 and 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.)
Julien Clément and Antoine Genitrini, Combinatorics of Reduced Ordered Binary Decision Diagrams: Application to uniform random sampling, arXiv:2211.04938 [cs.DS], 2022, Theorem 13, p. 8.
Julien Clément and Antoine Genitrini, An Iterative Approach for Counting Reduced Ordered Binary Decision Diagrams, Symp. Math. Found. Comp. Sci. (2023) Vol. 272, Art. 36.
FORMULA
a(n) = 2^(n - A284248(n)) + 2^2^A284248(n) - 1. (See Knuth 2011.) - 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
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Sep 26 2019
EXTENSIONS
More terms from Pontus von Brömssen, Apr 08 2020
STATUS
approved