Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093303
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093303 a(n) = (a(n-1)*(2n-1)) + 2n with a(0)=0. +0
1
0, 2, 10, 56, 400, 3610, 39722, 516400, 7746016, 131682290, 2501963530, 52541234152, 1208448385520, 30211209638026, 815702660226730, 23655377146575200, 733316691543831232, 24199450820946430690 (list; graph; listen)
OFFSET

0,2

CROSSREFS

Adjacent sequences: A093300 A093301 A093302 this_sequence A093304 A093305 A093306

Sequence in context: A165817 A000172 A097971 this_sequence A075870 A074608 A086871

KEYWORD

easy,nonn

AUTHOR

Emrehan Halici (emrehan(AT)halici.com.tr), Apr 24 2004

EXTENSIONS

More terms from Pab Ter (pabrlos(AT)yahoo.com), May 24 2004

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 November 8 07:45 EST 2009. Contains 166143 sequences.


AT&T Labs Research