login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A350191 Number of ways of placing maximum number of nonattacking rooks on a triangular board with edge-length n (not counting rotations and reflections as distinct). 3
1, 1, 1, 1, 5, 3, 1, 45, 29, 5, 807, 422, 29, 20022, 8270, 224, 642162, 211848, 3012 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,5
COMMENTS
a(n) = A350041(n) for n <> 10,13,16,19,...
Conjecture: a(3*n-2) = A309260(n). There is a nice analogy with A289893(3*n+1) = A002047(n).
LINKS
Vaclav Kotesovec, Example: All non-identical positions for n = 10, a(10) = 5
CROSSREFS
Sequence in context: A352136 A143410 A114344 * A350041 A317674 A201333
KEYWORD
nonn,more,hard
AUTHOR
Vaclav Kotesovec, Dec 19 2021
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 25 02:23 EDT 2024. Contains 374585 sequences. (Running on oeis4.)