[go: up one dir, main page]

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!)
Revision History for A033564 (Underlined text is an addition; strikethrough text is a deletion.)

Showing entries 1-10 | older changes
A033564 a(n+1) = concatenation of a(n) and a(n)+1, with a(0)=1.
(history; published version)
#29 by N. J. A. Sloane at Wed Oct 20 21:29:40 EDT 2021
STATUS

editing

approved

#28 by N. J. A. Sloane at Wed Oct 20 21:29:38 EDT 2021
NAME

a(n+1) = concatenation of a(n) and a(n)+1, with a(0)=1.

STATUS

approved

editing

#27 by N. J. A. Sloane at Wed Oct 20 21:27:29 EDT 2021
STATUS

editing

approved

#26 by N. J. A. Sloane at Wed Oct 20 21:27:26 EDT 2021
NAME

a(n+1) = concatenation of a(n) followed byand a(n)+1.

COMMENTS

The next term is too large to be included in the DATA section. - N. J. A. Sloane, Oct 20 2021

STATUS

approved

editing

#25 by N. J. A. Sloane at Wed Oct 20 21:21:21 EDT 2021
NAME

a(n+1) is the concatenation of ) = a(n) andfollowed by a(n)+1; a(0)=1.

COMMENTS

For every nonnegative integer n <= 8, a(n) is 2^n digits long, and each digit d in 1..n has exactly twice as many occurrences in a(n) as d+1 has, and each digit is evenly spaced throughout the sequence of digits in a(n). This makes this sequence useful as a model for spreading some integer number of items among some 2^n recipients if even spreading is a goal. For instance, to distribute five items among eight recipients, one could use a(3)=12131214, and distribute one item to each recipient marked with a 1 and one to each recipient marked with a 3, since 2^(3-1) + 2^(3-3) = 5. - Willis A. Hershey, Aug 25 2021

CROSSREFS

Cf. A001511, A018238, A082215.

STATUS

proposed

approved

#24 by Kevin Ryde at Fri Aug 27 19:08:50 EDT 2021
STATUS

editing

proposed

Discussion
Fri Oct 01 20:53
Sean A. Irvine: I'm not convinced about the value of this comment here, given that it only applies to n <= 8.
Wed Oct 20 21:21
N. J. A. Sloane: Agreed.  Let's drop the comment.
#23 by Kevin Ryde at Fri Aug 27 19:08:36 EDT 2021
CROSSREFS

Cf. A001511, A018238, A082215.

STATUS

proposed

editing

#22 by Jon E. Schoenfield at Wed Aug 25 22:02:09 EDT 2021
STATUS

editing

proposed

Discussion
Wed Aug 25 22:39
Kevin Ryde: The distribution you're looking at may be the ruler A001511: equal spacings, halving frequencies (count low 0 bits).  The digits here are 2^n initial terms from A001511, though only until carries make a mess as David says :).
22:46
Kevin Ryde: Maybe the OFFSET=0 here (so a(0)=1) was conceived so a(n) has had n many times concat done to it (none yet at a(0)), or just for the the happy effect that a(n) has 2^n digits.
Thu Aug 26 00:38
Kevin Ryde: Actually, there'd be a sum here using A001511 as coefficients rather than digits ...
09:46
Willis A. Hershey: A001511 follows the pattern I mentioned better, but in order to get the even spreading quality, you have to choose the first 2^n iterations of the sequence as your model, and since this sequence has 2^n kinda built in I thought it more relevant here
09:50
Willis A. Hershey: Also I think Jon's edits are very helpful
21:08
Jon E. Schoenfield: Okay, great!  Thanks!  :-)
Fri Aug 27 09:52
Kevin Ryde: The sequence here is a bit obscure, and its pattern breaks down after initial terms, so I think you'd be better in A001511 or its friend A007814.  There's a lot of material in both those already.  Not sure if proportions are covered.  I confess I don't entirely follow the aim of the spreading!

As digits go, A018238 and A082215 do similar but slightly different.
#21 by Jon E. Schoenfield at Wed Aug 25 21:59:34 EDT 2021
COMMENTS

For every nonnegative integer n <= 8, a(n) is 2^n digits long, and each digit in the sequenced fromin 1 to ..n has exactly twice as many occurrences as thein digita(n) as succeedingd+1 ithas, and each digit is evenly spaced throughout the sequence. of digits in a(n). This makes this sequence useful as a model for spreading some integer number of items among some 2^n recipients if even spreading is a goal. For instance, to distribute five items among eight recipients, one could use a(3)=12131214, and distribute one item to each recipient marked with a 1 and one to each recipient marked with a 3, since 2^(3-1) + 2^(3-3) = 5. - Willis A. Hershey, Aug 25 2021

Discussion
Wed Aug 25 22:02
Jon E. Schoenfield: I made a few changes to try to clarify things, e.g., that the even spacing "throughout the sequence" referred to the sequence of digits in a given single term a(n) -- not to the sequence of terms a(0), a(1), a(2), ....  Have I mangled the meaning anywhere (I hope not)?
#20 by Jon E. Schoenfield at Wed Aug 25 21:55:25 EDT 2021
COMMENTS

For every nonnegative integer n from 0- <= 8 inclusive, a(n) is 2^n digits long, and the distribution of each digit in the sequence from 1 to n has exactly twice as many occurrences as the digit succeeding it, and each digit is evenly spaced throughout the sequence. This makes this sequence useful as a model for spreading some integer number of items among some 2^n recipients if even spreading is a goal. For instance, to distribute five items among eight recipients, one could use a(3)=12131214, and distribute one item to each recipient marked with a 1 and one to each recipient marked with a 3, since 2^(3-1) + 2^(3-3) = 5. - Willis A. Hershey, Aug 25 2021

STATUS

proposed

editing

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 August 29 15:03 EDT 2024. Contains 375517 sequences. (Running on oeis4.)