The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A131520

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

A131520

Number of partitions of the graph G_n (defined below) into "strokes".
(history; published version)

#41 by Max Alekseyev at Mon Jul 18 20:42:12 EDT 2022

STATUS

editing

approved

#40 by Max Alekseyev at Mon Jul 18 20:42:09 EDT 2022

CROSSREFS

Cf. A131518, A131519, A173740, A354228.

STATUS

approved

editing

#39 by R. J. Mathar at Tue Feb 01 16:21:26 EST 2022

STATUS

editing

approved

#38 by R. J. Mathar at Tue Feb 01 16:18:28 EST 2022

FORMULA

a(n) = 2*(n-1) + 2^n = 2*A006127(n-1).

KEYWORD

nonn,easy

STATUS

approved

editing

#37 by Wesley Ivan Hurt at Thu May 20 12:58:04 EDT 2021

STATUS

editing

approved

#36 by Wesley Ivan Hurt at Thu May 20 12:57:49 EDT 2021

LINKS

<a href="/index/Rec#order_303">Index entries for linear recurrences with constant coefficients</a>, signature (4,-5,2).

FORMULA

a(n) = 4*a(n-1)-5*a(n-2)+2*a(n-3). - Wesley Ivan Hurt, May 20 2021

STATUS

approved

editing

#35 by OEIS Server at Sun Feb 14 04:03:24 EST 2021

LINKS

G. C. Greubel, <a href="/A131520/b131520_1.txt">Table of n, a(n) for n = 1..1000</a>

#34 by Joerg Arndt at Sun Feb 14 04:03:24 EST 2021

STATUS

reviewed

approved

Discussion

Sun Feb 14

04:03

OEIS Server: Installed new b-file as b131520.txt.  Old b-file is now b131520_1.txt.

#33 by Michel Marcus at Sun Feb 14 02:49:49 EST 2021

STATUS

proposed

reviewed

#32 by Joerg Arndt at Sun Feb 14 02:07:24 EST 2021

STATUS

editing

proposed