Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A007611
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A007611 n! + 2^n.
(Formerly M0807)
+0
1
2, 3, 6, 14, 40, 152, 784, 5168, 40576, 363392, 3629824, 39918848, 479005696, 6227028992, 87178307584, 1307674400768, 20922789953536, 355687428227072, 6402373705990144, 121645100409356288, 2432902008177688576 (list; graph; listen)
OFFSET

0,1

REFERENCES

51st Annual Putnam Competition, Problem A-1, Math. Mag., 64 (1991), 141-144.

Page 605, Exercise 135 in Calculus of a Single Variable for Advanced High School Students, 8th Edition, by Ron Larson, Robert P. Hostetler and Bruce H. Edwards, 2006.

LINKS

Index entries for sequences related to factorial numbers

FORMULA

T[n] = (n+4)T[n-1]-4nT[n-2]+(4n-8)T[n-3] with T[0]=2,T[1]=3,T[2]=6 - Dennis S. Kluk (mathemagician(AT)ameritech.net), Feb 12 2006

CROSSREFS

Adjacent sequences: A007608 A007609 A007610 this_sequence A007612 A007613 A007614

Sequence in context: A001420 A049339 A081293 this_sequence A098641 A056569 A094468

KEYWORD

nonn

AUTHOR

njas, Robert G. Wilson v (rgwv(AT)rgwv.com)

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified May 16 01:24 EDT 2008. Contains 139630 sequences.


AT&T Labs Research