The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A104763

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A104763

Triangle read by rows: Fibonacci(1), Fibonacci(2), ..., Fibonacci(n) in row n.
(history; published version)

#33 by Charles R Greathouse IV at Thu Sep 08 08:45:17 EDT 2022

PROG

(MAGMAMagma) [Fibonacci(k): k in [1..n], n in [1..15]]; // G. C. Greubel, Jul 13 2019

Discussion

Thu Sep 08

08:45

OEIS Server: https://oeis.org/edit/global/2944

#32 by Michel Marcus at Tue Feb 15 13:02:40 EST 2022

STATUS

editing

approved

#31 by Michel Marcus at Tue Feb 15 13:02:35 EST 2022

LINKS

Boris Putievskiy, <a href="http://arxiv.org/abs/1212.2732">Transformations Integer Sequences And Pairing Functions</a> , arXiv:1212.2732 [math.CO], 2012.

STATUS

approved

editing

Discussion

Tue Feb 15

13:02

Michel Marcus: just a comma

#30 by Alois P. Heinz at Sat Apr 18 15:37:34 EDT 2020

STATUS

reviewed

approved

#29 by Michel Marcus at Sat Apr 18 12:04:53 EDT 2020

STATUS

proposed

reviewed

#28 by F. Chapoton at Sat Apr 18 11:27:06 EDT 2020

STATUS

editing

proposed

Discussion

Sat Apr 18

12:04

Michel Marcus: oh dear, there are 7 such typos in OEIS

#27 by F. Chapoton at Sat Apr 18 11:27:00 EDT 2020

PROG

(PARI) for(n=1, 15, for(k=1, n, print1(fibonaccfibonacci(k), ", "))) \\ G. C. Greubel, Jul 13 2019

STATUS

approved

editing

Discussion

Sat Apr 18

11:27

F. Chapoton: fix typo in pari code

#26 by Susanna Cuyler at Sat Jul 13 16:56:41 EDT 2019

STATUS

proposed

approved

#25 by G. C. Greubel at Sat Jul 13 15:56:56 EDT 2019

STATUS

editing

proposed

#24 by G. C. Greubel at Sat Jul 13 15:45:06 EDT 2019

DATA

1, 1, 1, 1, 1, 2, 1, 1, 2, 3, 1, 1, 2, 3, 5, 1, 1, 2, 3, 5, 8, 1, 1, 2, 3, 5, 8, 13, 1, 1, 2, 3, 5, 8, 13, 21, 1, 1, 2, 3, 5, 8, 13, 21, 34, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233

LINKS

Boris Putievskiy, <a href="http://arxiv.org/abs/1212.2732">Transformations Integer Sequences And Pairing Functions</a> arXiv:1212.2732 [math.CO], 2012.

FORMULA

T(n,k) = A000045(k), 1<=k<=n. - R. J. Mathar, May 02 2008

EXAMPLE

1;

1, 1;

1, 1, 2;

1, 1, 2, 3;

1, 1, 2, 3, 5;

1, 1, 2, 3, 5, 8;

1, 1, 2, 3, 5, 8, 13; ...

...

MATHEMATICA

Table[Fibonacci[k], {n, 15}, {k, n}]//Flatten (* G. C. Greubel, Jul 13 2019 *)

PROG

(PARI) for(n=1, 15, for(k=1, n, print1(fibonacc(k), ", "))) \\ G. C. Greubel, Jul 13 2019

(MAGMA) [Fibonacci(k): k in [1..n], n in [1..15]]; // G. C. Greubel, Jul 13 2019

(Sage) [[fibonacci(k) for k in (1..n)] for n in (1..15)] # G. C. Greubel, Jul 13 2019

(GAP) Flat(List([1..15], n-> List([1..n], Fibonacci(k) ))) # G. C. Greubel, Jul 13 2019

STATUS

approved

editing