login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A002826 Number of precomplete Post functions of n variables.
(Formerly M3883 N1593)
4
1, 5, 18, 82, 643, 15182, 7848984, 549761932909, 10626621620680478174719, 1701411834605079120446041612364090304458, 79607061350691085453966118726400345961810854094316840855510985236799831016092 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

REFERENCES

Jablonskii, S. V., Some results in the theory of functional systems (Russian), in Proceedings of the International Congress of Mathematicians (Helsinki, 1978), pp. 963-971, Acad. Sci. Fennica, Helsinki, 1980.

Rosenberg, Ivo; The number of maximal closed classes in the set of functions over a finite domain. J. Combinatorial Theory Ser. A 14 (1973), 1-7.

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Zaharova, E. Ju.; Kudrjavcev, V. B.; Jablonskii, S. V. Precomplete classes in $k$-valued logics. (Russian) Dokl. Akad. Nauk SSSR 186 1969 509-512. English translation in Soviet Math. Doklady 10 (No. 3, 1969), 618-622.

LINKS

Table of n, a(n) for n=1..11.

Rosenberg, Ivo; The number of maximal closed classes in the set of functions over a finite domain, J. Combinatorial Theory Ser. A 14 (1973), 1-7.

Zaharova, E. Ju.; Kudrjavcev, V. B.; Jablonskii, S. V., Precomplete classes in $k$-valued logics. (Russian), Dokl. Akad. Nauk SSSR 186 (1969), 509-512. English translation in Soviet Math. Doklady 10 (No. 3, 1969), 618-622. [Annotated scanned copy]

FORMULA

a(n) = A002824(n) + A246069(n) + A246137(n) + A008827(n) + A002825(n) + A246417(n). - Sean A. Irvine, Aug 25 2014

CROSSREFS

Cf. A002824, A002825, A008827, A246069, A246137, A246417.

Sequence in context: A082034 A259340 A241713 * A019046 A141733 A216723

Adjacent sequences:  A002823 A002824 A002825 * A002827 A002828 A002829

KEYWORD

nonn

AUTHOR

N. J. A. Sloane.

EXTENSIONS

More terms from Sean A. Irvine, Aug 25 2014

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 15 09:05 EST 2019. Contains 329995 sequences. (Running on oeis4.)