The On-Line Encyclopedia of Integer Sequences (OEIS)

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

A087322

Triangle T read by rows: T(n, 1) = 2*n + 1. For 1 < k <= n, T(n, k) = 2*T(n,k-1) + 1.
(history; published version)

#29 by OEIS Server at Tue Oct 17 05:01:21 EDT 2023

LINKS

Paolo Xausa, <a href="/A087322/b087322_1.txt">Table of n, a(n) for n = 1..11325</a> (rows 1..150 of the triangle, flattened)

#28 by Alois P. Heinz at Tue Oct 17 05:01:21 EDT 2023

STATUS

proposed

approved

Discussion

Tue Oct 17

05:01

OEIS Server: Installed first b-file as b087322.txt.

#27 by Paolo Xausa at Tue Oct 17 03:47:53 EDT 2023

STATUS

editing

proposed

#26 by Paolo Xausa at Tue Oct 17 03:45:23 EDT 2023

LINKS

Paolo Xausa, <a href="/A087322/b087322_1.txt">Table of n, a(n) for n = 1..11325</a> (rows 1..150 of the triangle, flattened)

MATHEMATICA

A087322row[n_]:=NestList[2#+1&, 2n+1, n-1]; Array[A087322row, 10] (* Paolo Xausa, Oct 17 2023 *)

STATUS

approved

editing

#25 by N. J. A. Sloane at Mon Feb 15 22:34:43 EST 2021

STATUS

proposed

approved

#24 by Petros Hadjicostas at Mon Feb 15 15:39:50 EST 2021

STATUS

editing

proposed

#23 by Petros Hadjicostas at Mon Feb 15 15:39:14 EST 2021

FORMULA

T(n,2) = 4*n + 3 for n >= 2.

#22 by Petros Hadjicostas at Mon Feb 15 15:38:41 EST 2021

FORMULA

Sum_{k=1..n} T(n,k) = A190730(n) for n >= 1.

T(n,n) = A087323(n) for n >= 1.

STATUS

proposed

editing

#21 by Petros Hadjicostas at Mon Feb 15 15:38:09 EST 2021

STATUS

editing

proposed

#20 by Petros Hadjicostas at Mon Feb 15 15:36:57 EST 2021

FORMULA

T(n,2) = 4*n + 3.

Recurrence: T(n,k) = 3*T(n,k-1) - 2*T(n,k-2) for n >= 2 and 2 <= k <= n with initial condition conditions the values of T(n, 1) = 2*n + 1 for and T(n >= 0,2).