|
|
|
|
|
|
|
|
|
#35 by Charles R Greathouse IV at Thu Sep 08 08:44:59 EDT 2022
|
|
| PROG
|
(MAGMAMagma) R<x>:=PowerSeriesRing(Integers(), 30); Coefficients(R!( (2-3*x-x^2)/((1-x)*(1-2*x-x^2)) )); // G. C. Greubel, Oct 18 2019
|
|
|
|
|
Discussion
|
| Thu Sep 08
| 08:44
| OEIS Server: https://oeis.org/edit/global/2944
|
|
|
|
|
|
|
#34 by Joerg Arndt at Mon Jun 08 04:14:53 EDT 2020
|
|
| COMMENTS
|
It appears that a(n) is also the first member of each segment of Recamán's sequence (A005132). Here's a Python program which shows this:
# assume that "Rdata" is an array with the first N Recaman values
lst = []
nmax = 0
for i in range(len(Rdata)):
if Rdata[i] > nmax:
nmax = Rdata[i]
if Rdata[i+1] > Rmax:
lst.append(i+1)
This script assumes that the first member of each segment is larger than the previous largest member of the sequence, which is empirically confirmed up to R(1e6)
|
|
| STATUS
|
editing
approved
|
|
|
|
|
|
|
#33 by Alois P. Heinz at Sun Apr 12 21:52:31 EDT 2020
|
|
|
|
|
|
Discussion
|
| Mon Apr 13
| 07:49
| Alois P. Heinz: And please read this: https://oeis.org/wiki/Style_Sheet#Signing_your_name_when_you_contribute_to_an_existing_sequence
|
| Mon Apr 20
| 13:04
| OEIS Server: This sequence has not been edited or commented on for a week
yet is not proposed for review. If it is ready for review, please
visit https://oeis.org/draft/A052937 and click the button that reads
"These changes are ready for review by an OEIS Editor."
Thanks.
- The OEIS Server
|
| Mon Apr 27
| 13:13
| OEIS Server: This sequence has not been edited or commented on for a week
yet is not proposed for review. If it is ready for review, please
visit https://oeis.org/draft/A052937 and click the button that reads
"These changes are ready for review by an OEIS Editor."
Thanks.
- The OEIS Server
|
| Mon May 04
| 13:44
| OEIS Server: This sequence has not been edited or commented on for a week
yet is not proposed for review. If it is ready for review, please
visit https://oeis.org/draft/A052937 and click the button that reads
"These changes are ready for review by an OEIS Editor."
Thanks.
- The OEIS Server
|
| Mon May 11
| 14:35
| OEIS Server: This sequence has not been edited or commented on for a week
yet is not proposed for review. If it is ready for review, please
visit https://oeis.org/draft/A052937 and click the button that reads
"These changes are ready for review by an OEIS Editor."
Thanks.
- The OEIS Server
|
| Mon May 18
| 15:02
| OEIS Server: This sequence has not been edited or commented on for a week
yet is not proposed for review. If it is ready for review, please
visit https://oeis.org/draft/A052937 and click the button that reads
"These changes are ready for review by an OEIS Editor."
Thanks.
- The OEIS Server
|
| Mon May 25
| 01:56
| Joerg Arndt: Has the interest been lost?
|
| Mon Jun 01
| 02:56
| OEIS Server: This sequence has not been edited or commented on for a week
yet is not proposed for review. If it is ready for review, please
visit https://oeis.org/draft/A052937 and click the button that reads
"These changes are ready for review by an OEIS Editor."
Thanks.
- The OEIS Server
|
| Mon Jun 08
| 03:01
| OEIS Server: This sequence has not been edited or commented on for a week
yet is not proposed for review. If it is ready for review, please
visit https://oeis.org/draft/A052937 and click the button that reads
"These changes are ready for review by an OEIS Editor."
Thanks.
- The OEIS Server
|
|
|
|
|
|
|
#32 by Alexander D. Deich at Sun Apr 12 17:14:28 EDT 2020
|
|
|
|
|
|
Discussion
|
| Sun Apr 12
| 19:20
| Robert Israel: I don't think Comments should contain a program. Instead, just say up to what n you have confirmed your statement.
|
|
|
|
|
|
|
#31 by Alexander D. Deich at Sun Apr 12 11:15:52 EDT 2020
|
|
| COMMENTS
|
It appears that a(n) is also the first member of each segment of Recamán's sequence (A005132). Here's a Python program which shows this:
# assume that "Rdata" is an array with the first N Recaman values
lst = []
nmax = 0
for i in range(len(Rdata)):
if Rdata[i] > nmax:
nmax = Rdata[i]
if Rdata[i+1] > Rmax:
lst.append(i+1)
This script assumes that the first member of each segment is larger than the previous largest member of the sequence, which is empirically confirmed up to R(1e6)
|
|
| STATUS
|
approved
editing
|
|
|
|
|
|
|
#30 by Michel Marcus at Mon Oct 21 11:33:04 EDT 2019
|
|
|
|
|
|
|
|
#29 by Joerg Arndt at Mon Oct 21 08:33:21 EDT 2019
|
|
|
|
|
|
|
|
#28 by Joerg Arndt at Mon Oct 21 08:33:17 EDT 2019
|
|
|
|
|
|
|
|
#27 by Joerg Arndt at Mon Oct 21 08:33:13 EDT 2019
|
|
| FORMULA
|
a(n) = 1 + Pell(n+1) = 1 + Fibonacci(n+1,2), where Fibonacci(n,x) are the Fibonacci polynomials. - G. C. Greubel, Oct 18 2019
|
|
| STATUS
|
proposed
editing
|
|
|
|
|
|
|
#26 by G. C. Greubel at Fri Oct 18 15:25:11 EDT 2019
|
|
|
|
|
|
Discussion
|
| Sat Oct 19
| 01:06
| Michel Marcus: a(n) = 1 + Pell(n+1) is already there by - Graeme McRae, Aug 03 2006
|
|
|
|
|
|
