login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A144656 Defined by a(n) = (n mod 2) if n<=3, otherwise a(n) = (n^2-5n+7)*(n-2)*a(n-2)/(n-3) + (n^2-5n+7)*a(n-2) - (n-2)*a(n-3)/(n-3). 1
0, 1, 0, 1, 4, 49, 900, 24649, 944784, 48455521, 3210355600, 267186643801, 27307626948900, 3363915436531441, 491705171699154084, 84158959760104032049, 16675767262618669710400, 3787671541267275818341249, 977702867682508392324162624, 284628954669920840314598014801 (list; graph; refs; listen; history; internal format)
OFFSET

0,5

COMMENTS

Terms are squares; square roots give A001053.

REFERENCES

S. B. Ekhad, Problem 10356, Amer. Math. Monthly, 101 (1994), 75.

M. E. Larsen, Summa Summarum, A. K. Peters, Wellesley, MA, 2007; see p. 35.

MAPLE

a:=proc(n) option remember; local m;

if n=0 then RETURN(0); fi;

if n=1 then RETURN(1); fi;

if n=2 then RETURN(0); fi;

if n=3 then RETURN(1); fi;

m:=n-3;

RETURN((m^2+m+1)*(m+1)*a(n-1)/m+(m^2+m+1)*a(n-2)-(m+1)*a(n-3)/m);

end;

CROSSREFS

Sequence in context: A055793 A202829 A204233 * A121275 A188682 A191301

Adjacent sequences:  A144653 A144654 A144655 * A144657 A144658 A144659

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Jan 30 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 05:12 EST 2012. Contains 205694 sequences.