|
|
|
|
#20 by N. J. A. Sloane at Thu Dec 10 04:14:19 EST 2020
|
|
|
|
#19 by Stefano Spezia at Thu Dec 10 02:18:52 EST 2020
|
|
|
|
#18 by Stefano Spezia at Thu Dec 10 02:18:17 EST 2020
|
| COMMENTS
|
The two cousins both have 500-term b-files, so maybe someone could create a 1000-term b-file here.
|
|
|
Discussion
|
Thu Dec 10
| 02:18
| Stefano Spezia: Added bfile as requested by Neil's comment that I removed
|
|
|
|
#17 by Stefano Spezia at Thu Dec 10 02:17:58 EST 2020
|
| LINKS
|
Stefano Spezia, <a href="/A339572/b339572.txt">Table of n, a(n) for n = 0..1000</a>
|
| STATUS
|
proposed
editing
|
|
|
|
#16 by N. J. A. Sloane at Thu Dec 10 00:13:48 EST 2020
|
|
|
|
#15 by N. J. A. Sloane at Thu Dec 10 00:13:46 EST 2020
|
| COMMENTS
|
The two cousins both have 500-term b-files, so maybe someone could create a 1000-term b-file here.
|
| STATUS
|
approved
editing
|
|
|
|
#14 by N. J. A. Sloane at Thu Dec 10 00:11:02 EST 2020
|
|
|
|
#13 by N. J. A. Sloane at Thu Dec 10 00:11:00 EST 2020
|
| COMMENTS
|
Sequences A000071 and A001610 look like long-lost cousins, and this entry smoothly interleaves them. Differences between successive terms are Fibonacci numbers.
|
| STATUS
|
approved
editing
|
|
|
|
#12 by Wesley Ivan Hurt at Wed Dec 09 23:38:15 EST 2020
|
|
|
|
#11 by Wesley Ivan Hurt at Wed Dec 09 23:37:33 EST 2020
|
| FORMULA
|
a(n) = Fibonacci(k+2) + () + Fibonacci(k)*(n mod 2)*Fibonacci(k) - 1, where k = floor(n/2). - Wesley Ivan Hurt, Dec 09 2020
|
| KEYWORD
|
nonn,newchanged
|
| STATUS
|
approved
editing
|
|
|
|