Various sequences from counting subsets

zbMATH Open1483.11024arXiv2005.10081MaRDI QIDQ4958084FDOQ4958084

Authors: Hùng Viẹt Chu 

Publication date: 6 September 2021

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.

Full work available at URL: https://arxiv.org/abs/2005.10081

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

Mathematics Subject Classification ID

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

Cited In (8)

• Title not available (Why is that?)
• The Fibonacci sequence and Schreier-Zeckendorf sets
• Schreier Multisets and the $s$-step Fibonacci Sequences
• Counting sequences
• On Schreier-type Sets, Partitions, and Compositions
• Higher order Fibonacci sequences from generalized Schreier sets
• Counting unions of Schreier sets
• Formulas for the numbers of sequences containing a given pattern given number of times

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)