The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A348621 The number of additions required to compute the permanent of general n X n matrices using Ryser's formula without Gray code ordering. 0
 0, 4, 21, 82, 275, 836, 2373, 6406, 16647, 41992, 103433, 249866, 593931, 1392652, 3227661, 7405582, 16842767, 38010896, 85196817, 189792274, 420478995, 926941204, 2034237461, 4445962262, 9680453655, 21005074456, 45432700953, 97978941466, 210721832987, 452045307932 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 REFERENCES Herbert John Ryser, Combinatorial Mathematics, volume 14 of Carus Mathematical Monographs. American Mathematical Soc., (1963), pp. 24-28. LINKS Table of n, a(n) for n=1..30. Han Mao Kiah, Alexander Vardy and Hanwen Yao, Computing Permanents on a Trellis, arXiv:2107.07377 [cs.IT], 2021. See Table 1 p. 3. Index entries for linear recurrences with constant coefficients, signature (8,-25,38,-28,8). FORMULA a(n) = (n^2 - 2*n + 2)*2^(n-1) + n - 2. a(n) = n*A000337(n-1) + A000079(n) - 2. a(n) = 8*a(n-1) - 25*a(n-2) + 38*a(n-3) - 28*a(n-4) + 8*a(n-5) for n > 5. O.g.f.: x^2*(4 - 11*x + 14*x^2 - 8*x^3)/((1 - x)^2*(1 - 2*x)^3). E.g.f.: 1 + exp(x)*(x - 2) + exp(2*x)*(2*x^2 - x + 1). MATHEMATICA LinearRecurrence[{8, -25, 38, -28, 8}, {0, 4, 21, 82, 275}, 30] CROSSREFS Cf. A000079, A000337, A059672, A160457. Sequence in context: A280434 A163697 A134424 * A277794 A292126 A174797 Adjacent sequences: A348618 A348619 A348620 * A348622 A348623 A348624 KEYWORD nonn,easy AUTHOR Stefano Spezia, Oct 25 2021 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.

Last modified September 14 06:54 EDT 2024. Contains 375920 sequences. (Running on oeis4.)