Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A144462
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A144462 A triangle sequence designed as a step function around the determinants: a(n)=A000045(n); t(n,m)=If[m == 0 || m == 1, 2 - m, If[ m < n, Ceiling[(a(m) - 1)/a(n) + 1], a(n) + 1]]. +0
1
2, 2, 1, 2, 1, 2, 2, 1, 1, 3, 2, 1, 1, 2, 4, 2, 1, 1, 2, 2, 6, 2, 1, 1, 2, 2, 2, 9, 2, 1, 1, 2, 2, 2, 2, 14, 2, 1, 1, 2, 2, 2, 2, 2, 22, 2, 1, 1, 2, 2, 2, 2, 2, 2, 35, 2, 1, 1, 2, 2, 2, 2, 2, 2, 2, 56 (list; graph; listen)
OFFSET

1,1

COMMENT

Row sums are:{2, 3, 5, 7, 10, 14, 19, 26, 36, 51, 74}.

FORMULA

a(n)=A000045(n); t(n,m)=If[m == 0 || m == 1, 2 - m, If[ m < n, Ceiling[(a(m) - 1)/a(n) + 1], a(n) + 1]].

EXAMPLE

{2},

{2, 1},

{2, 1, 2},

{2, 1, 1, 3},

{2, 1, 1, 2, 4},

{2, 1, 1, 2, 2, 6},

{2, 1, 1, 2, 2, 2, 9},

{2, 1, 1, 2, 2, 2, 2, 14},

{2, 1, 1, 2, 2, 2, 2, 2, 22},

{2, 1, 1, 2, 2, 2, 2, 2, 2, 35},

{2, 1, 1, 2, 2, 2, 2, 2, 2, 2, 56}

MATHEMATICA

Clear[a, b, t, n, m]; a[n_] := Fibonacci[n]; t[n_, m_] := If[m == 0 || m == 1, 2 - m, If[ m < n, Ceiling[(a[m] - 1)/a[n] + 1], a[n] + 1]]; Table[Table[t[n, m], {m, 0, n}], {n, 0, 10}]; Flatten[%]

CROSSREFS

Cf. A000045.

Sequence in context: A026607 A052005 A138702 this_sequence A112104 A059426 A082389

Adjacent sequences: A144459 A144460 A144461 this_sequence A144463 A144464 A144465

KEYWORD

nonn,uned

AUTHOR

Roger L. Bagula and Gary W. Adamson (rlbagulatftn(AT)yahoo.com), Oct 08 2008

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