|
|
|
|
#17 by Peter Luschny at Sun Nov 27 07:58:31 EST 2022
|
|
|
|
#16 by Joerg Arndt at Sun Nov 27 06:41:33 EST 2022
|
|
|
|
#15 by Peter Bala at Fri Nov 25 11:55:55 EST 2022
|
|
|
|
#14 by Peter Bala at Fri Nov 25 11:55:15 EST 2022
|
|
|
|
#13 by Peter Bala at Fri Nov 25 10:40:04 EST 2022
|
| COMMENTS
|
In the ring of 2-adic integers the sequence {Fibonacci(4^n)} converges to this constant. For example, Fibonacci(4^10) reduced modulo 4^10 = 651835 = 10011111001000111011 (binary representation). Reading the binary digits from right to left gives the first 20 terms of this sequence. - Peter Bala, Nov 22 2022
|
| KEYWORD
|
nonn,base,changed,easy
|
|
|
|
#12 by Peter Bala at Tue Nov 22 10:47:22 EST 2022
|
| COMMENTS
|
In the ring of 2-adic integers the sequence {Fibonacci(4^n)} converges to this constant. - Peter Bala, Nov 22 2022
|
| CROSSREFS
|
Cf. A145231, A341602, A341601 (successive approximations of the associated 2-adic square root of -3/5), A318962, A318963 (expansion of sqrt(-7)), A322217, A341540 (expansion of sqrt(17)).
|
| STATUS
|
approved
editing
|
|
|
|
#11 by Joerg Arndt at Thu Feb 18 02:53:38 EST 2021
|
|
|
|
#10 by Jianing Song at Wed Feb 17 08:02:03 EST 2021
|
|
|
|
#9 by Jianing Song at Wed Feb 17 07:59:21 EST 2021
|
| KEYWORD
|
nonn,base,new
|
| STATUS
|
approved
editing
|
|
|
|
#8 by Alois P. Heinz at Tue Feb 16 20:49:47 EST 2021
|
|
|
|