(Translated by https://www.hiragana.jp/)
The On-Line Encyclopedia of Integer Sequences (OEIS)
login

Revision History for A185116

(Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Number of connected 2-regular simple graphs on n vertices with girth at least 6.
(history; published version)
#31 by N. J. A. Sloane at Fri Aug 02 18:55:44 EDT 2024
STATUS

proposed

approved

#30 by Paolo Xausa at Fri Aug 02 16:11:53 EDT 2024
STATUS

editing

proposed

#29 by Paolo Xausa at Fri Aug 02 16:11:09 EDT 2024
MATHEMATICA

PadRight[{1, 0, 0, 0, 0, 0}, 100, 1] (* Paolo Xausa, Aug 02 2024 *)

STATUS

approved

editing

#28 by Alois P. Heinz at Wed May 29 20:04:59 EDT 2024
STATUS

proposed

approved

#27 by Elmo R. Oliveira at Wed May 29 16:02:25 EDT 2024
STATUS

editing

proposed

#26 by Elmo R. Oliveira at Wed May 29 16:00:57 EDT 2024
FORMULA

a(0)=1; for 0 < n < 6 a(n)=0; for n >= 6 , , a(n)=1.

STATUS

proposed

editing

#25 by Stefano Spezia at Tue May 28 05:31:59 EDT 2024
STATUS

editing

proposed

#24 by Stefano Spezia at Tue May 28 05:31:54 EDT 2024
LINKS

Jason Kimberley, <a href="/wiki/User:Jason_Kimberley/C_girth_ge_6">Connected regular graphs with girth at least 6</a>.

Jason Kimberley, <a href="/wiki/User:Jason_Kimberley/C_k-reg_girth_ge_g_index">Index of sequences counting connected k-regular simple graphs with girth at least g</a>.

<a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (1).

STATUS

proposed

editing

#23 by Elmo R. Oliveira at Tue May 28 05:19:58 EDT 2024
STATUS

editing

proposed

#22 by Elmo R. Oliveira at Tue May 28 05:17:24 EDT 2024
COMMENTS

Decimal expansion of 900001/9000000. - Elmo R. Oliveira, May 28 2024

FORMULA

a(0)=1; for 0 < n < 6 a(n)=0; for n>=6 , a(n)=1.

G.f.: (x^6-x+1)/(1-x). - Elmo R. Oliveira, May 28 2024

STATUS

approved

editing