Integer Sequences Related to Compositions without 2’s
نویسندگان
چکیده
A composition of a positive integer n consists of an ordered sequence of positive integers whose sum is n. We investigate compositions in which the summand 2 is not allowed, and count the total number of such compositions and the number of occurrences of the summand i in all such compositions. Furthermore, we explore patterns in the values for Cj(n, 2̂), the number of compositions of n without 2’s having j summands, and show connections to several known sequences, for example the ndimensional partitions of 4 and 5.
منابع مشابه
Meta-Fibonacci Sequences, Binary Trees and Extremal Compact Codes
We consider a family of meta-Fibonacci sequences which arise in studying the number of leaves at the largest level in certain infinite sequences of binary trees, restricted compositions of an integer, and binary compact codes. For this family of meta-Fibonacci sequences and two families of related sequences we derive ordinary generating functions and recurrence relations. Included in these fami...
متن کاملS-Restricted Compositions Revisited
An S-restricted composition of a positive integer n is an ordered partition of n where each summand is drawn from a given subset S of positive integers. There are various problems regarding such compositions which have received attention in recent years. This paper is an attempt at finding a closed-form formula for the number of S-restricted compositions of n. To do so, we reduce the problem to...
متن کاملNon-Abelian Sequenceable Groups Involving ?-Covers
A non-abelian finite group is called sequenceable if for some positive integer , is -generated ( ) and there exist integers such that every element of is a term of the -step generalized Fibonacci sequence , , , . A remarkable application of this definition may be find on the study of random covers in the cryptography. The 2-step generalized sequences for the dihedral groups studi...
متن کاملCyclic Compositions of a Positive Integer with Parts Avoiding an Arithmetic Sequence
A linear composition of a positive integer n is a finite sequence of positive integers (called parts) whose sum equals n. A cyclic composition of n is an equivalent class of all linear compositions of n that can be obtained from each other by a cyclic shift. In this paper, we enumerate the cyclic compositions of n that avoid an increasing arithmetic sequence of positive integers. In the case wh...
متن کاملFixed Sequences for a Generalization of the Binomial Interpolated Operator and for some Other Operators
This paper is devoted to the study of eigen-sequences for some important operators acting on sequences. Using functional equations involving generating functions, we completely solve the problem of characterizing the fixed sequences for the Generalized Binomial operator. We give some applications to integer sequences. In particular we show how we can generate fixed sequences for Generalized Bin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003