[math-fun] Pick any 4 successive terms a, b, c, d and have a/b = c/d.
Hello Math-Fun, I've sent this 5 days ago to SeqFans but it seems that it never reached the list. I try here, Best, É. ---------------------------------------------------- Hello (SeqFans) Math-Fun, I was looking for a seq S (of distinct integers) where one could pick any 4 successive terms a, b, c, d and have a/b = c/d. I quickly found https://oeis.org/A038754 [Original definition of the seq is between brackets] [a(2n) = 3^n, a(2n+1) = 2*3^n]. S = 1, 2, 3, 6, 9, 18, 27, 54, 81, 162, 243, 486,... The above seq starts with 1,2,3. The start 1,2,4 produces the powers of 2. The start 1,2,5 produces https://oeis.org/A026383 [a(n) = 5a(n-2), starting 1,2]. The start 1,2,6, produces https://oeis.org/A026549 [Ratios of successive terms are 2,3,2,3,2,3,2,3...] The start 1,2,7 produces https://oeis.org/A123752 [a(n) = 7*a(n-2), a(0) = 1, a(1) = 2]. The start 1,2,8 produces https://oeis.org/A098232 [Largest power of 2 <= 3^n]. The start 1,2,9 produces https://oeis.org/A083423 [a(n) = (5*3^n + (-3)^n)/6]. The start 1,2,10 produces https://oeis.org/A004643 [Powers of 2 written in base 4]. etc. (I love the rainbow of definitions!) The start 1,3,2 produces https://oeis.org/A164073 [a(n) = 2*a(n-2) for n > 2; a(1) = 1, a(2) = 3]. The start 1,3,4 produces https://oeis.org/A084221 [a(n+2) = 4*a(n), with a(0)=1, a(1)=3]. The start 1,3,5 produces https://oeis.org/A056487 [a(n) = 5^(n/2) for n even, a(n) = 3*5^((n-1)/2) for n odd]. ....(!?) and produces also https://oeis.org/A111386 [a(1) = 1, a(2) = 3; for n >= 3, take a(n) to be the smallest odd number not occurring earlier such that a(n-1) divides the concatenation a(n-2)a(n)]. The start 1,3,6 produces https://oeis.org/A026532 [Ratios of successive terms are 3,2,3,2,3,2,3,2...] The start 1,3,7 produces 1,3,7,21,49,147,343,1029,... _not in the OEIS_. The start 1,3,8 produces https://oeis.org/A096886 [Expansion of (1+3*x)/(1-8*x^2)]. The start 1,3,9 produces the powers of 3 The start 1,3,10 produces https://oeis.org/A004663 [Powers of 3 written in base 9]. etc. The start 1,4,2 produces https://oeis.org/A143095 [(1, 2, 4, 8,...) interleaved with (4, 8, 16, 32,...)]. But we have repeated terms there. The start 1,4,3 produces https://oeis.org/A166552 [a(n) = 3*a(n-2) for n > 2; a(1) = 1; a(2) = 4] The start 1,4,5 produces https://oeis.org/A133632 [a(1)=1, a(n)=(p-1)*a(n-1), if n is even, else a(n)=p*a(n-2), where p=5]. The start 1,4,6 produces https://oeis.org/A164532 [a(n) = 6*a(n-2) for n > 2; a(1) = 1, a(2) = 4]. The start 1,4,7 produces 1,4,7,28,49,196,343,1372,... _nt in the OEIS_ The start 1,4,8 produces https://oeis.org/A094015 [Expansion of (1+4x)/(1-8x^2)]. The start 1,4,9 produces https://oeis.org/A133125 [A133080 * A000244]. The start 1,4,10 produces https://oeis.org/A136859 [Numbers n such that n and the square of n use only the digits 0, 1, 4 and 6]. etc. (another rainbow!) The start 1,5,2 produces 1,5,2,10,4,20,8,40,16,80,32,160,... _not in the OEIS_. The start 1,5,3 produces https://oeis.org/A166465 [a(n) = 3*a(n-2) for n > 2; a(1) = 1, a(2) = 5]. The start 1,5,4 produces 1,5,4,20,16,80,64,320,256,... _not in the OEIS_. The start 1,5,6 produces https://oeis.org/A166023 [a(n) = 6*a(n-2) for n > 2; a(1) = 1, a(2) = 5] The start 1,5,7 produces 1,5,7,35,49,245,343,... _not in the OEIS_. The start 1,5,8 produces 1,5,8,40,64,320,512,... _not in the OEIS_. The start 1,5,9 produces 1,5,9,45,81,405,729,... _not in the OEIS_. The start 1,5,10 produces https://oeis.org/A268100 [a(n) = 2^((n-1) mod 2)*5*10^floor((n-1)/2)] etc. The start 1,6,2 produces https://oeis.org/A163864 [a(n) = 2*a(n-2) for n > 2; a(1) = 1, a(2) = 6]. The start 1,6,3 produces https://oeis.org/A166450 [a(n) = 3*a(n-2) for n > 2; a(1) = 1, a(2) = 6]. The start 1,6,4 produces https://oeis.org/A081631 [2*2^n-(-2)^n]. The start 1,6,5 produces 1,6,5,30,25,150,125,750,... _not in the OEIS_. The start 1,6,7 produces 1,6,7,42,49,... _not in the OEIS_. The start 1,6,8 produces https://oeis.org/A164640 [a(n) = 8*a(n-2) for n > 2; a(1) = 1, a(2) = 6]. The start 1,6,9 produces 1,6,9,54,81,... _not in the OEIS_. The start 1,6,10 produces 1,6,10,60,100,600,1000,6000,10000 _not in the OEIS_. etc. The start 1,7,2 produces 1,7,2,14,4,28,8,56,16,112,32,224,... _not in the OEIS_. The start 1,7,3 produces https://oeis.org/A166481 [a(n) = 3*a(n-2) for n > 2; a(1) = 1; a(2) = 7]. The start 1,7,4 produces 1,7,4,28,16,96,64,... _not in the OEIS_. The start 1,7,5 produces 1,7,5,35,25,175,... _not in the OEIS_. The start 1,7,6 produces 1,7,6,42,36,252,... _not in the OEIS_. The start 1,7,8 produces 1,7,8,56,64,... _not in the OEIS_. The start 1,7,9 produces 1,7,9,63,81,... _not in the OEIS_. The start 1,7,10 produces 1,7,10,70,100,700,1000,7000,... _not in the OEIS_. etc. The start 1,8,2 produces https://oeis.org/A164587 [a(n) = 2*a(n - 2) for n > 2; a(1) = 1, a(2) = 8]. The start 1,8,3 produces 1,8,3,24,9,72,27,216,81,648,243,... _not in the OEIS_. The start 1,8,4 produces almost https://oeis.org/A135520 [erase the 1st term, then a(n) = 4*a(n-2)]. The start 1,8,5 produces 1,8,5,40,25,200,125,... _not in the OEIS_. The start 1,8,6 produces 1,8,6,48,36,... _not in the OEIS_. The start 1,8,7 produces 1,8,7,56,49,... _not in the OEIS_. The start 1,8,9 produces 1,8,9,72,81,... _not in the OEIS_. The start 1,8,10 produces 1,8,10,80,100,800,1000,... _not in the OEIS_. etc. The start 1,9,2 produces 1,9,2,18,4,36,8,72,16,144,32,288,... _not in the OEIS_. The start 1,9,3 produces almost https://oeis.org/A162852 [a(n) = 3*a(n-2) for n > 2; a(1) = 3, a(2) = -1]. But, again, a lot of not-distinct terms. The start 1,9,4 produces 1,9,4,36,16,144,... _not in the OEIS_. The start 1,9,5 produces 1,9,5,45,25,225,... _not in the OEIS_. The start 1,9 6 produces 1,9,6,54,36,... _notin the OEIS_. The start 1,9,7 produces 1,9,7,63,49,... _not in the OEIS_. The start 1,9,8 produces 1,9,8,72,64,... _not in the OEIS_. The start 1,9,10 produces 1,9,10,90,100,900,1000,... _not in the OEIS_. etc. The start 1,10,2 produces 1,10,2,20,4,40,8,80,16,160,32,320,... _not in the OEIS_. The start 1,10,3 produces 1,10,3,30,9,90,27,270,... _not in the OEIS_. etc. The start 2,1,6 produces 2,1,6,3,18,9,54,27,... _not in the OEIS_. As 19 is prime, the start 20,19 produces 20,19,40,38,80,72,... _not in the OEIS_ (and never in the OEIS, I guess). etc. Note that the remark here https://oeis.org/A164073, by a friend of mine ("Absolute second differences are the sequence itself"), is always true for some seqs above that follow the pattern: 1, a, 2, 2a, 4, 4a, 8, 8a, 16, 16a... for a = 0 to k. Oh, and what about picking 5 (instead of 4) successive integers a, b, c, d, e in a seq of distinct terms such that a/b is always equal to d/e? Never mind, this has been already submitted by Paul Curtz: https://oeis.org/A133464 Too good, the OEIS'authors!-)) My two,three, four cents. É. P.-S.#1 Many thanks to Klaus Brockhaus who computed 10 years ago a lot of the above, and forgive the errors I left in this mail, despite my carefull rerereading). P.-S.#2 Let me pick again (in a similar seq T) 5 successive integers a, b, c, d, e -- but such that a/c is now equal to d/e: T = 1, 2, 3, 4, 12, 24, 96, 576,... Ah ah, _T is not in the OEIS_!-)) Best, É.
For #1, in case it helps, I think the general term is given by (starting at 0) a^Floor[1 - i/2] b^(Mod[i, 2]) c^Floor[i/2] or alternatively, (c/a)^Floor[i/2] * (a if i is even, otherwise b). For example, starting with 2, 1, 6, In[10]:= Table[2^Floor[1 - i/2]1^(Mod[i,2]) 6^Floor[i/2],{i,0,10}] Out[10]= {2,1,6,3,18,9,54,27,162,81,486} I think this implies that the sequence will consist of integers so long as a divides c, though I'm not sure how to handle the requirement that all of the integers in the sequence be unique. Thanks! --Neil Bickford
Hello Math-Fun, A Marf-Low rule is coded in a 3-digit base-10 integer abc where neither a nor b = 0. A seq of integers is then produced with this rule. This abc integer is interpreted like this: a = a(1) [taken in the set 1,2,3,4,5,6,7,8,9] b = a multiplicative factor [taken in the same set] c = a stop-digit [taken in the set 1,2,3,4,5,6,7,8,9,0]. Example: the Marf-Low rule 173 produces the seq: S = 1, 7, 49, 343, 2, 14, 98, 686, 4802, 33614, 3, 4, 28, 196, 1372, 5, 35, 6, 42, 296,... Explanation: #Start the seq with a(1) = a [here a(1) = 1] #If a(n) doesn't show the stop-digit c, then a(n+1) = 7*a(n) [this is the case here, as 7, the result of 7*a(1), does not show any "3" digit] #else a(n+1) is the smallest integer not yet in the seq. [we will see this below]. The rule 173 produces indeed 1, 7, 49, 343 which stops and restarts with 2, 14, 98, 686, 4802, 33614 which stops and restarts with 3 which stops and restarts with 4, 28, 196, 1372 which stops and restarts with 5, 35 which stops, etc. Which Marf-Low rule (from 110 to 999) produces the nicest 10,000-point graph, according to you? Best, É.
Update here in French (and small corrections in the "Explanation" part): https://bit.ly/2B931qM Best, É.
Le 14 octobre 2019 à 18:58, Éric Angelini <bk263401@skynet.be> a écrit :
Hello Math-Fun, A Marf-Low rule [...]
I created A328086 for Rule 173 On Tue, Oct 15, 2019 at 7:56 AM Éric Angelini <bk263401@skynet.be> wrote:
Update here in French (and small corrections in the "Explanation" part): https://bit.ly/2B931qM Best, É.
Le 14 octobre 2019 à 18:58, Éric Angelini <bk263401@skynet.be> a écrit :
Hello Math-Fun, A Marf-Low rule [...]
_______________________________________________ math-fun mailing list math-fun@mailman.xmission.com https://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun
Hello Math-Fun (cross-posted on SeqFans), Take an integer abc...z and multiply it by all its digits: if the string abc...z appears in the result, we have a "revenant number". Look at 87 for instance: 87 * 8 * 7 = 4872. As the string 87 is visible in the result, 87 is a revenant. So is 792 because 792 * 7 * 9 * 2 = 99792. And 9375 as 9375 * 9 * 3 * 7 * 5 = 8859375. If we start a sequence R of revenants we'll get (not in the OEIS): R = 0, 1, 5, 6, 11, 25, 52, 77, 87, 111, 125, 152, 215, 251, 375, 376, 455, 512, 521, 545, 554, 736, 792, 1111, 1125, 1152, 1215, 1251, 1455, 1512, 1521, 1545, 1554, 2115, 2151, 2174, 2255, 2511, 2525, 2552, 4155, 4515, 4551, 5112, 5121, 5145, 5154, 5211, 5225, 5252, 5415, 5451, 5514, 5522, 5541, 5558, 5585, 5855, 8555, 8772, 9375,... R is infinite, of course, as all repunits (like 11, 111, 1111, 1111,...) will be in R. Will you find the next revenant > 62227496 whose "image" doesn't show any zero? More details, DiCaprio and a graph here: http://cinquantesignes.blogspot.com/2019/10/revenant-numbers.html Best, É.
Hello math-Fun, I've spent a few hours re-discovering hot water (as we say in French) which is explained here: https://bit.ly/2p7WvhF You can skip the above link as the re-discovered sequence was "Numbers a = b + c where a, b, and c contain the same decimal digits" (https://oeis.org/A203024) As we learn from the past, my question is now: is the sequence "Numbers a = b + c + d where a, b, c and d contain the same decimal digits" already in the OEIS? Best, É.
participants (3)
-
Neil Bickford -
Neil Sloane -
Éric Angelini