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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A053410 a(1) = 0, a(2) = 16, a(2n+1) = 10a(2n) - a(2n-1), a(2n) = 10a(2n-1) - a(2n-2) + 16. 1
0, 16, 160, 1600, 15840, 156816, 1552320, 15366400, 152111680, 1505750416, 14905392480, 147548174400, 1460576351520, 14458215340816, 143121577056640, 1416757555225600, 14024453975199360, 138827782196768016 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

REFERENCES

O. Bottema: Verscheidenheden XXVI. Het vraagstuk van Malfatti, Euclides 25 (1949-50), pp. 144-149. [in Dutch].

O. Bottema, The Malfatti problem (translation of Het vraagstuk van Malfatti), Forum Geom. 1 (2001) 43-50.

LINKS

Bottema article in Forum Geometricorum

Bottema article, from Euclides

FORMULA

a(n) = 10a(n-1) - 10a(n-3) + a(n-4)

CROSSREFS

Cf. A001078.

Sequence in context: A038846 A079767 A079768 * A197677 A197535 A204297

Adjacent sequences:  A053407 A053408 A053409 * A053411 A053412 A053413

KEYWORD

easy,nonn

AUTHOR

Antreas P. Hatzipolakis (xpolakis(AT)otenet.gr), Jan 09 2000

EXTENSIONS

More terms from James A. Sellers (sellersj(AT)math.psu.edu), Jan 10 2000

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 16:39 EST 2012. Contains 205823 sequences.