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!)
A347847 a(n) is the number of (strict) chains of subspaces with ends 0 and (F_11)^n. 1
1, 13, 1863, 2939835, 51032042341, 9744480919457833, 20467619608367348894343, 472899301427912499856338638715, 120188439043897767650882899915804254541, 336007833514175643082885509533867247163277824513 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) = Sum_{L partition of n} A347492(n, L) * A036038(len(L), sig(L)), where sig(L) is the partition composed by the part multiplicities of L.
EXAMPLE
a(3) = 1863 = 1 * 1 + 133 * 2 + 1596 * 1, counting:
the unrefined chain 0 < (F_11)^3;
133 chains 0 < V < (F_11)^3, with dim(V) = 1; another
133 chains 0 < V < (F_11)^3, with dim(V) = 2; and
1596 chains 0 < V_1 < V_2 < (F_11)^3.
CROSSREFS
Sequence in context: A201177 A015513 A062314 * A340139 A263221 A177914
KEYWORD
nonn
AUTHOR
Álvar Ibeas, Sep 15 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 April 24 19:39 EDT 2024. Contains 371963 sequences. (Running on oeis4.)