|
|
|
|
| A371061
|
|
a(1)=1, a(2)=2; for n > 2, a(n) is the sum of the largest proper divisor of each of the previous two terms, except that the term itself is used if it has no proper divisors > 1.
(history;
published version)
|
|
|
|
|
#37 by OEIS Server at Sat May 25 15:31:52 EDT 2024
|
|
| LINKS
|
Paolo Xausa, <a href="/A371061/b371061_1.txt">Table of n, a(n) for n = 1..10000</a>
|
|
|
|
|
|
|
#36 by N. J. A. Sloane at Sat May 25 15:31:52 EDT 2024
|
|
|
|
|
|
Discussion
|
| Sat May 25
| 15:31
| OEIS Server: Installed first b-file as b371061.txt.
|
|
|
|
|
|
|
#35 by Jon E. Schoenfield at Fri May 24 21:32:07 EDT 2024
|
|
|
|
|
|
|
|
#34 by Jon E. Schoenfield at Fri May 24 21:32:04 EDT 2024
|
|
| FORMULA
|
a(n+18) = a(n) for n>= >= 39. - R. J. Mathar, May 24 2024
|
|
| STATUS
|
proposed
editing
|
|
|
|
|
|
|
#33 by Paolo Xausa at Fri May 24 15:53:26 EDT 2024
|
|
|
|
|
|
|
|
#32 by Paolo Xausa at Fri May 24 15:46:09 EDT 2024
|
|
| LINKS
|
Paolo Xausa, <a href="/A371061/b371061_1.txt">Table of n, a(n) for n = 1..10000</a>
|
|
|
|
|
|
|
#31 by Paolo Xausa at Fri May 24 15:40:58 EDT 2024
|
|
|
|
|
|
|
|
#30 by R. J. Mathar at Fri May 24 04:14:09 EDT 2024
|
|
|
|
|
|
|
|
#29 by R. J. Mathar at Fri May 24 04:10:16 EDT 2024
|
|
| FORMULA
|
a(n+18) = a(n) for n>=39. - R. J. Mathar, May 24 2024
|
|
|
|
|
|
|
#28 by Kevin Ryde at Tue Apr 30 19:42:04 EDT 2024
|
|
| LINKS
|
<a href="/index/Rec#order_17">Index entries for linear recurrences with constant coefficients</a>, signature (1,-1,1,-1,1,-1,1,-1,1,-1,1,-1,1,-1,1,-1,1).
|
|
| STATUS
|
proposed
editing
|
|
|
|
|
Discussion
|
| Tue Apr 30
| 19:44
| Kevin Ryde: Also in code, "sublist in list" is unreliable due to digit concats. Seems to get the right answer in this case, but its nature is wrong. Hard-coded "1000" is not a good idea.
|
|
| 19:45
| Kevin Ryde: EXAMPLE doesn't need to repeat the definition (just work through a couple of illustrative cases).
|
|
| 19:45
| Kevin Ryde: Left in editing for your attention.
|
|
| 19:49
| Kevin Ryde: Oh, actually primeTest() is not a prime test, it's the largest proper divisor thing. So no it's not isprime(), but yes it's far easier to let a library find relevant factor (if it exists).
|
| Tue May 07
| 22:43
| 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/A371061 and click the button that reads
"These changes are ready for review by an OEIS Editor."
Thanks.
- The OEIS Server
|
| Wed May 15
| 02:08
| 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/A371061 and click the button that reads
"These changes are ready for review by an OEIS Editor."
Thanks.
- The OEIS Server
|
| Wed May 22
| 03:50
| 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/A371061 and click the button that reads
"These changes are ready for review by an OEIS Editor."
Thanks.
- The OEIS Server
|
|
|
|
|
|
