0,2

A000005(a(n)) = A000290(n+1). - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Mar 04 2007

If X_1, X_2, ..., X_n is a partition of the set {1,2,...,2*n} into blocks of size 2 then, for n>=1, a(n) is equal to the number of functions f : {1,2,..., 2*n}->{1,2,3,4} such that for fixed y_1,y_2,...,y_n in {1,2,3,4} we have f(X_i)<>{y_i}, (i=1,2,...,n). - Milan R. Janjic (agnus(AT)blic.net), May 24 2007

S. Plouffe, Approximations de S\'{e}ries G\'{e}n\'{e}ratrices et Quelques Conjectures}, Dissertation, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.

Milan Janjic, Enumerative Formulas for Some Functions on Finite Sets

S. Plouffe, Approximations de S\'{e}ries G\'{e}n\'{e}ratrices et Quelques Conjectures}, Dissertation, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.

S. Plouffe, 1031 Generating Functions and Conjectures, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.

Tanya Khovanova, Recursive Sequences

P. J. Cameron, Sequences realized by oligomorphic permutation groups, J. Integ. Seqs. Vol. 3 (2000), #00.1.5.

INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 279

Y. Puri and T. Ward, Arithmetic and growth of periodic orbits, J. Integer Seqs., Vol. 4 (2001), #01.2.1.

G.f.: 1/(1-15x), e.g.f.: exp(15x)

A001024:=-1/(-1+15*z); [Conjectured by S. Plouffe in his 1992 dissertation.]

Adjacent sequences: A001021 A001022 A001023 this_sequence A001025 A001026 A001027

Sequence in context: A137916 A078364 A012852 this_sequence A012643 A067222 A041422

nonn

njas

More terms from James A. Sellers (sellersj(AT)math.psu.edu), Sep 19 2000