The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A342963

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

A342963

a(n) is the number of sticky polyhexes of with 2*n cells.
(history; published version)

#16 by N. J. A. Sloane at Tue Apr 20 10:08:26 EDT 2021

STATUS

proposed

approved

#15 by Woosuk Kwak at Thu Apr 08 20:15:44 EDT 2021

STATUS

editing

proposed

#14 by Woosuk Kwak at Thu Apr 08 20:14:00 EDT 2021

DATA

1, 2, 15, 110, 1051, 10636, 113290, 1234189, 13674761, 153289285

STATUS

approved

editing

Discussion

Thu Apr 08

20:15

Woosuk Kwak: a(8)-a(10) by Stack Exchange user Delfad0r, using the code on https://codegolf.stackexchange.com/a/222796/78410.

#13 by Peter Luschny at Thu Apr 08 07:37:46 EDT 2021

STATUS

editing

approved

#12 by Peter Luschny at Thu Apr 08 07:37:43 EDT 2021

NAME

a(n) is the number of sticky polyhexes of size with 2*n cells.

STATUS

reviewed

editing

#11 by Peter Kagey at Mon Apr 05 14:50:13 EDT 2021

STATUS

proposed

reviewed

Discussion

Mon Apr 05

16:24

Andrew Howroyd: Could we say "with 2n cells" rather than of size 2n?

#10 by Woosuk Kwak at Thu Apr 01 00:04:39 EDT 2021

STATUS

editing

proposed

#9 by Woosuk Kwak at Thu Apr 01 00:04:15 EDT 2021

COMMENTS

This sequence counts free polyhexes; two polyhexes which are equivalent under reflection and/or rotation are counted only once.

STATUS

proposed

editing

#8 by Omar E. Pol at Wed Mar 31 22:15:16 EDT 2021

STATUS

editing

proposed

#7 by Omar E. Pol at Wed Mar 31 22:14:38 EDT 2021

NAME

a(n) is the number of sticky polyhexes of size 2n2*n.

COMMENTS

a(n) < A000228(2n) for n > 1.

CROSSREFS

a(n) < A000228(2n) for n > 1.

Cf. A000228.

KEYWORD

nonn,hard,more,changed

STATUS

proposed

editing