Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A000472
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A000472 a(n) = a(n-1)^2 + (a(n-2)+1)(a(n-1)-a(n-2)^2 ). +0
1
2, 5, 28, 802, 643726, 414383582242, 171713753231982206218246, 29485613049014079571725771288849499850026859242 (list; graph; listen)
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

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;

CROSSREFS

Sequence in context: A068069 A105787 A110497 this_sequence A049050 A098858 A134449

Adjacent sequences: A000469 A000470 A000471 this_sequence A000473 A000474 A000475

KEYWORD

nonn,nice,easy

AUTHOR

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

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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research