%I A002469 M3962 N1635
%S A002469 0,0,1,5,31,203,1501,12449,114955,1171799,13082617,158860349,
%T A002469 2085208951,29427878435,444413828821,7151855533913
%N A002469 The game of Mousetrap with n cards.
%C A002469 Contribution from Gary W. Adamson (qntmpkt(AT)yahoo.com), Apr 17 2009: 
               (Start)
%C A002469 a(n) = sum of (n-2)-th row terms, triangle A159610; equivalent to:
%C A002469 A002469(n) = (n-2)*A000255(n-1) + A000166(n). Example: A002469(4) = 2*A000255(3) 
               + A000166(4) or: 31 = 2*11 + 9. (End)
%D A002469 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%D A002469 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 
               (includes this sequence).
%D A002469 R. K. Guy, Unsolved Problems Number Theory, E37.
%D A002469 R. K. Guy and R. J. Nowakowski, ``Mousetrap,'' in D. Miklos, V.T. Sos 
               and T. Szonyi, eds., Combinatorics, Paul Erdos is Eighty. Bolyai 
               Society Math. Studies, Vol. 1, pp. 193-206, 1993.
%D A002469 Mundfrom, Daniel J.; A problem in permutations: the game of `Mousetrap'. 
               European J. Combin. 15 (1994), no. 6, 555-560.
%D A002469 A. Steen, Some formulae respecting the game of mousetrap, Quart. J. Pure 
               Applied Math., 15 (1878), 230-241.
%H A002469 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               Mousetrap.html">Link to a section of The World of Mathematics.</a>
%Y A002469 Cf. A002468, A002467, A028306, etc.
%Y A002469 Cf. A159610, A000255, A000166 [From Gary W. Adamson (qntmpkt(AT)yahoo.com), 
               Apr 17 2009]
%Y A002469 Sequence in context: A108079 A164038 A084235 this_sequence A092636 A007197 
               A002649
%Y A002469 Adjacent sequences: A002466 A002467 A002468 this_sequence A002470 A002471 
               A002472
%K A002469 nonn,nice
%O A002469 2,4
%A A002469 N. J. A. Sloane (njas(AT)research.att.com).