Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A053410
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A053410 a(1) = 0, a(2) = 16, a(2n+1) = 10a(2n) - a(2n-1), a(2n) = 10a(2n-1) - a(2n-2) + 16. +0
2
0, 16, 160, 1600, 15840, 156816, 1552320, 15366400, 152111680, 1505750416, 14905392480, 147548174400, 1460576351520, 14458215340816, 143121577056640, 1416757555225600, 14024453975199360, 138827782196768016 (list; graph; listen)
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 this_sequence A000811 A041484 A011551

Adjacent sequences: A053407 A053408 A053409 this_sequence 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

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research