Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A083474
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A083474 a(n)=T(n)^2-n!. +0
1
0, 7, 30, 76, 105, -279, -4256, -39024, -360855, -3625775, -39912444, -478995516, -62270125, 19, -87178280175, -1307674353600, -20922789869504, -355687428072591, -640237370569875, 9, -121645100408795900, -2432902008176595900, -51090942171709386639 (list; graph; listen)
OFFSET

1,2

EXAMPLE

a(3)=T(3)^2-3!=6^2-6=36-6=30

PROGRAM

(PARI) t(n)=n*(n+1)/2 for(i=1, 50, print1(", "t(i)^2-i!))

CROSSREFS

Adjacent sequences: A083471 A083472 A083473 this_sequence A083475 A083476 A083477

Sequence in context: A116283 A139274 A086640 this_sequence A030440 A045889 A038739

KEYWORD

sign

AUTHOR

Jon Perry (perry(AT)globalnet.co.uk), Jun 08 2003

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 15 09:18 EDT 2008. Contains 145015 sequences.


AT&T Labs Research