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

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A347846 a(n) is the number of (strict) chains of subspaces with ends 0 and (F_9)^n. 1
1, 11, 1093, 979163, 7895396653, 572984959186643, 374244678702477629605, 2199939020346263706461674955, 116387990444553949414146511586296381, 55417662962428710787068813831544886356769891 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) = Sum_{L partition of n} A347491(n, L) * A036038(len(L), sig(L)), where sig(L) is the partition composed by the part multiplicities of L.
EXAMPLE
a(3) = 1093 = 1 * 1 + 91 * 2 + 910 * 1, counting:
the unrefined chain 0 < (F_9)^3;
91 chains 0 < V < (F_9)^3, with dim(V) = 1; another
91 chains 0 < V < (F_9)^3, with dim(V) = 2; and
910 chains 0 < V_1 < V_2 < (F_9)^3.
CROSSREFS
Sequence in context: A126197 A355546 A090814 * A319424 A348269 A153435
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 December 11 02:45 EST 2023. Contains 367717 sequences. (Running on oeis4.)