|
|
|
|
|
|
|
|
|
#29 by Michael De Vlieger at Fri Sep 08 22:37:08 EDT 2023
|
|
|
|
|
|
|
|
#28 by Jon E. Schoenfield at Fri Sep 08 22:08:41 EDT 2023
|
|
|
|
|
|
|
|
#27 by Jon E. Schoenfield at Fri Sep 08 22:08:39 EDT 2023
|
|
| NAME
|
a(1)=1 and a(2)=1; if a(n-1)+) + a(n-2) == 0 (mod n ) then a(n) = (a(n-1)+) + a(n-2))/n else a(n) = a(n-1)+) + a(n-2).
|
|
| FORMULA
|
ifIf a(n-1)+) + a(n-2) == 0 (mod n ) then a(n) = (a(n-1)+) + a(n-2))/n else, otherwise a(n) = a(n-1)+) + a(n-2).
a(n) != a(n-1) + a(n-2) for n in { A333578 }..
|
|
| EXAMPLE
|
a(5) = 1 because a(4)+) + a(3) = 5, and 5 mod 5 is equals = 0, thenso a(5) = (a(4)+) + a(3))/5 = 1.
|
|
| STATUS
|
approved
editing
|
|
|
|
|
|
|
#26 by Harvey P. Dale at Sat May 22 18:25:45 EDT 2021
|
|
|
|
|
|
|
|
#25 by Harvey P. Dale at Sat May 22 18:25:41 EDT 2021
|
|
| MATHEMATICA
|
nxt[{n_, a_, b_}]:={n+1, b, Which[Divisible[a+b, n+1], (a+b)/(n+1), True, a+b]}; NestList[nxt, {2, 1, 1}, 50][[All, 2]] (* Harvey P. Dale, May 22 2021 *)
|
|
| STATUS
|
approved
editing
|
|
|
|
|
|
|
#24 by Alois P. Heinz at Sat Mar 28 12:31:07 EDT 2020
|
|
|
|
|
|
|
|
#23 by Alois P. Heinz at Sat Mar 28 12:21:45 EDT 2020
|
|
| FORMULA
|
a(n) != a(n-1) + a(n-2) for n in { A333578 }.
|
|
|
|
|
Discussion
|
| Sat Mar 28
| 12:22
| Alois P. Heinz: A333578 is a new sequence by Eder Vanzei ...
|
|
|
|
|
|
|
#22 by Alois P. Heinz at Sat Mar 28 12:19:45 EDT 2020
|
|
|
|
|
|
|
|
#21 by Alois P. Heinz at Sat Mar 28 12:16:15 EDT 2020
|
|
| LINKS
|
Alois P. Heinz, <a href="/A330139/b330139.txt">Table of n, a(n) for n = 1..4800</a>
|
|
|
|
|
|
|
#20 by Alois P. Heinz at Sat Mar 28 12:05:09 EDT 2020
|
|
|
|
|
|
|
