Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A158786
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A158786 A recursive sequence: e(n,k)=(e(n - 1, k)*e(n, k - 1) + 1)/e(n - 1, k - 1) +0
1
1, 25, 4, 1, 100, 25, 11, 4, 1, 275, 100, 25, 29, 11, 4, 1, 725, 275, 100, 25, 76, 29, 11, 4, 1 (list; table; graph; listen)
OFFSET

2,2

COMMENT

Row sums are:

{1, 25, 5, 125, 16, 400, 45, 1125, 121,...}.

REFERENCES

H. S. M. Coxeter, Regular Polytopes, 3rd ed., Dover, NY, 1973, pp 159-162

FORMULA

e(n,k)=(e(n - 1, k)*e(n, k - 1) + 1)/e(n - 1, k - 1);

out_(n,m)=5*(e(n,m)

EXAMPLE

{1},

{25},

{4, 1},

{100, 25},

{11, 4, 1},

{275, 100, 25},

{29, 11, 4, 1},

{725, 275, 100, 25},

{76, 29, 11, 4, 1}

MATHEMATICA

Clear[e, n, k];

e[n_, 0] := Sqrt[5]*(GoldenRatio^n + GoldenRatio^(-n));

e[n_, k_] := 0 /; k >= n;

e[n_, k_] := (e[n - 1, k]*e[n, k - 1] + 1)/e[n - 1, k - 1];

Table[Table[5*Rationalize[N[e[n, k]]], {k, Mod[ n, 2] + 1, n - 1, 2}], {n, 1, 10}];

Flatten[%]

CROSSREFS

A158753, A002878

Sequence in context: A040614 A040615 A040610 this_sequence A040611 A040608 A077490

Adjacent sequences: A158783 A158784 A158785 this_sequence A158787 A158788 A158789

KEYWORD

nonn,tabl,uned

AUTHOR

Roger L. Bagula and Gary W. Adamson (rlbagulatftn(AT)yahoo.com), Mar 26 2009

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 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research