![]() |
|
|
#1 |
|
"Matthew Anderson"
Dec 2010
Oregon, USA
25×52 Posts |
Hi Mersenneforum,
Find the next number in the sequence - 3, 5, 8, 13, 22, ? There are a few ways to go with this , but here is some Maple computer code - a := Vector[row](9) a[1] := 3; for i from 2 to 9 do a[i] := 2*a[i-1]-i+1 end do a ***** end Maple code ***** [3,5,8,13,22,39 ... ] Regards, Matt |
|
|
|
|
|
#2 | |
|
"Forget I exist"
Jul 2009
Dumbassville
20C016 Posts |
Quote:
without the hint there's always multiple possible ways to continue a sequence so it kind of is redundant. for example one pattern possibility is that we add a fibonacci numbers to the previous term as we go after an initial 0 to get our different 3+0 5+0, 8+1, 13+1, which would lead to 36, we could use a sequence of difference attempt and get: 3,5,8,13,22 2,3,5,9 - first difference 1,2,4 - second difference. the second difference pattern is potentially powers of 2 that leads to a first difference of 17 which gets to 39. etc. |
|
|
|
|
|
|
#3 |
|
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
100101000001012 Posts |
39 if these are Number of steps to reach 0 when starting from 2^n and iterating the map x -> x - (number of 1's in binary representation of x)
39 if these are a(n) = 1 + 2^(n-1) + n 37 if these are Powers of fifth root of 13 rounded up. 36 if these are Number of 1-dimensional sand piles with n grains. 36 if these are Number of typable lambda terms of size n with size 0 for the variables. 36 if these are Floor(Fibonacci(n)/4) 36 if these are Powers of fifth root of 13 rounded to nearest integer 36 if these are Antidiagonal sums of triangle [URL="http://oeis.org/A124428"]A124428[/URL]. 36 if these are Floor(sqrt(F(n+2)^2 + F(n)^2)) 31 if these are q-sinh(x) evaluated at q=-x 37 if these are Numbers of Twopins positions. So, take your pick
|
|
|
|
|
|
#4 |
|
Bamboozled!
"πΊππ·π·π"
May 2003
Down not across
2A0116 Posts |
|
|
|
|
|
|
#5 |
|
Romulan Interpreter
Jun 2011
Thailand
7×1,373 Posts |
Additional possible values, unmentioned before:
28, 30, 32, or 40 (all with "tough logic" behind) Last fiddled with by LaurV on 2016-10-24 at 03:31 |
|
|
|
|
|
#6 |
|
Sep 2002
Database er0rr
3,739 Posts |
|
|
|
|
|
|
#7 |
|
"Forget I exist"
Jul 2009
Dumbassville
26·131 Posts |
even 38 is possible just take the second order difference to be a different pattern like 1 more than the triangular numbers and you get 7 as the next second difference and that leads to 9+7 =16 22+16 =38.
|
|
|
|
|
|
#8 |
|
"Matthew Anderson"
Dec 2010
Oregon, USA
25·52 Posts |
Hi ,
Thank you for all the input. Although I didn't read them all. I'm glad we all have this little corner of the internet to communicate. This is a .org website and not a .com . For this I am grateful. Regards, Matt hew C A |
|
|
|
|
|
#9 |
|
Feb 2013
1CA16 Posts |
47
|
|
|
|
|
|
#10 |
|
"Forget I exist"
Jul 2009
Dumbassville
203008 Posts |
a note on the code it can be simplified by taking the start index of 0 and starting i from 1 in theory.
|
|
|
|
|
|
#11 |
|
"Matthew Anderson"
Dec 2010
Oregon, USA
14408 Posts |
Hi math and computer creatures who actually read this webpage,
(Hi all) I appreciate the input on this next number puzzle. I found this puzzle on the internet. I don't remember where I found it. Happy November 1st to all. Last night was Halloween here in the U.S. Regards, Matt |
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Finding multiples of a real number that are close to a whole number | mickfrancis | Math | 16 | 2017-03-01 07:17 |
| Estimating the number of primes in a partially-factored number | CRGreathouse | Probability & Probabilistic Number Theory | 15 | 2014-08-13 18:46 |
| Number of distinct prime factors of a Double Mersenne number | aketilander | Operazione Doppi Mersennes | 1 | 2012-11-09 21:16 |
| Estimating the number of prime factors a number has | henryzz | Math | 7 | 2012-05-23 01:13 |
| Fermat number F6=18446744073709551617 is a composite number. Proof. | literka | Factoring | 5 | 2012-01-30 12:28 |