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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A000472 a(n) = a(n-1)^2 + (a(n-2)+1)(a(n-1)-a(n-2)^2 ). 1
2, 5, 28, 802, 643726, 414383582242, 171713753231982206218246, 29485613049014079571725771288849499850026859242 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

REFERENCES

Damiani, E.; D'Antona, O.; Naldi, G.; and Pavarino, L.; Tiling bricks with bricks. Stud. Appl. Math. 83 (1990), number 2, 91-110.

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 1..14

Index entries for sequences related to bricks

MAPLE

A000472 := proc(n) option remember; if n<=2 then 3*n-1 else A000472(n-1)^2+(1+A000472(n-2))*(A000472(n-1)-A000472(n-2)^2); fi; end;

MATHEMATICA

RecurrenceTable[{a[1]==2, a[2]==5, a[n]==a[n-1]^2+(a[n-2]+1)(a[n-1]- a[n-2]^2)}, a[n], {n, 10}] (* From Harvey P. Dale, Sep 29 2011 *)

PROG

(MAGMA) I:=[2, 5]; [n le 2 select I[n] else  Self(n-1)^2 + (Self(n-2)+1)*(Self(n-1)-Self(n-2)^2 ): n in [1..10]]; // Vincenzo Librandi, Sep 30 2011

CROSSREFS

Sequence in context: A068069 A105787 A110497 * A049050 A178322 A165161

Adjacent sequences:  A000469 A000470 A000471 * A000473 A000474 A000475

KEYWORD

nonn,nice,easy

AUTHOR

Ottavio D'Antona [ dantona(AT)hermes.dsi.unimi.it ]

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 13 10:39 EST 2012. Contains 205459 sequences.