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!)
A365566 Triangle read by rows: T(n,d) is the number of inequivalent properly d-dimensional n-polysticks (or polyedges), 1 <= d <= n. 4
1, 1, 1, 1, 4, 2, 1, 15, 12, 3, 1, 54, 105, 39, 6, 1, 221, 863, 566, 117, 11 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
1,5
LINKS
FORMULA
T(n,n) = A000055(n+1).
EXAMPLE
Triangle begins:
n\d | 1 2 3 4 5 6
----+---------------------
1 | 1
2 | 1 1
3 | 1 4 2
4 | 1 15 12 3
5 | 1 54 105 39 6
6 | 1 221 863 566 117 11
CROSSREFS
Cf. A000055, A049430, A365565 (row sums).
Sequence in context: A171650 A225476 A143777 * A326659 A236830 A269736
KEYWORD
nonn,tabl,hard,more
AUTHOR
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 August 10 14:52 EDT 2024. Contains 375056 sequences. (Running on oeis4.)