A325936 - OEIS

The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

A325936

a(n) is the number of creatures that can be made from exactly n Palago tiles.

0, 0, 1, 0, 1, 1, 2, 2, 9, 13, 37, 81, 205, 512, 1335, 3404, 8922, 23592, 62630, 167622 (list; graph; refs; listen; history; text; internal format)

	OFFSET	`1,7`
	COMMENTS	`A "creature" in Palago is a closed shape of a single color across several Palago tiles, perhaps with one or more holes.` `A Palago tile is a hexagonal tile with four regions of alternating colors. See links for illustrations.` `Creatures are counted up to rotation, reflection, and swapping colors.`
	LINKS	`Table of n, a(n) for n=1..20.` `Cameron Browne, Counting Creatures` `Code Golf Stack Exchange, Counting creatures on a hexagonal tiling`
	CROSSREFS	`Cf. A000228.` `Sequence in context: A066324 A143146 A298663 * A185755 A278458 A309705` `Adjacent sequences: A325933 A325934 A325935 * A325937 A325938 A325939`
	KEYWORD	`nonn,more`
	AUTHOR	`Peter Kagey, Sep 09 2019`
	STATUS	`approved`

Last modified April 21 14:09 EDT 2021. Contains 343154 sequences. (Running on oeis4.)