Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A068444
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A068444 a(0) = 10; for n>0, a(n) = n*a(n-1)-n-2. +0
1
10, 7, 10, 25, 94, 463, 2770, 19381, 155038, 1395331, 13953298, 153486265, 1841835166, 23943857143, 335213999986, 5028209999773, 80451359996350, 1367673119937931, 24618116158882738, 467744207018772001 (list; graph; listen)
OFFSET

0,1

REFERENCES

From a quiz.

PROGRAM

(PARI) s=10; for(n=1, 30, s=n*s-n-2; print1(s, ", "); );

CROSSREFS

Adjacent sequences: A068441 A068442 A068443 this_sequence A068445 A068446 A068447

Sequence in context: A089245 A098592 A016731 this_sequence A038309 A128357 A024134

KEYWORD

nonn,easy

AUTHOR

Nancy Zhang, Feb 24 2002

EXTENSIONS

More terms from Benoit Cloitre (benoit7848c(AT)orange.fr), Mar 10 2002

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 20:39 EST 2009. Contains 166234 sequences.


AT&T Labs Research