Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A007566
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A007566 a(n+1) = (2n+3)*a(n) - 2n*a(n-1) + 8n, a(0) = 1, a(1) = 3.
(Formerly M3081)
+0
4
1, 3, 21, 151, 1257, 12651, 151933, 2127231, 34035921, 612646867, 12252937701, 269564629863, 6469551117241, 168208329048891, 4709833213369677, 141294996401091151 (list; graph; listen)
OFFSET

0,2

REFERENCES

D. Doster, Problem 10403, Amer. Math. Monthly, Vol. 101 (1994), p. 792; Solution, Vol. 104 (1997), p. 368.

FORMULA

a(n) = 2n*a(n-1) + (2n-1)^2; a(n) = 2[ e^(1/2)n!2^n ] - (2n+1).

CROSSREFS

A007566(n) = 2*A010844(n) - (2n+1).

Adjacent sequences: A007563 A007564 A007565 this_sequence A007567 A007568 A007569

Sequence in context: A037768 A037656 A074577 this_sequence A074575 A091171 A026333

KEYWORD

nonn,easy

AUTHOR

njas

EXTENSIONS

Comments from Michael Somos

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 October 6 16:13 EDT 2008. Contains 144667 sequences.


AT&T Labs Research