Various sequences from counting subsets

MaRDI QIDQ4958084zbMATH OpenFDO

Authors Hùng Viẹt Chu

Publication date 6 September 2021

Full work available at URL https://arxiv.org/abs/2005.10081, https://www.fq.math.ca/Abstracts/59-2/chu2.pdf

Mathematics Subject Classification ID

Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Abstract: We count the number of subsets of $1,2,cdots,n$ under different conditions and study the sequence obtained as we let $n$ increase.

Recommendations

• The Fibonacci sequence and Schreier-Zeckendorf sets
• Higher order Fibonacci sequences from generalized Schreier sets
• scientific article; zbMATH DE number 7646868
• scientific article; zbMATH DE number 4051717
• A dichotomy on Schreier sets

Cited in

(8)

• Formulas for the numbers of sequences containing a given pattern given number of times
• Counting sequences
• Higher order Fibonacci sequences from generalized Schreier sets
• The Fibonacci sequence and Schreier-Zeckendorf sets
• scientific article; zbMATH DE number 7734734 (Why is no real title available?)
• Schreier Multisets and the s-step Fibonacci Sequences
• On Schreier-type Sets, Partitions, and Compositions
• Counting unions of Schreier sets

This page was built for publication: Various sequences from counting subsets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4958084)