|
|
|
|
|
|
|
|
|
#21 by N. J. A. Sloane at Mon Sep 19 21:47:31 EDT 2016
|
|
|
|
|
|
|
|
#20 by N. J. A. Sloane at Mon Sep 19 21:47:29 EDT 2016
|
|
| REFERENCES
|
Cantor, D. G. "Investigation of T-numbers and E-sequences." In Computers in Number Theory, ed. AOL AtkinsAtkin and BJ Birch, Acad. Press, NY (1971); pp. 137-140.
|
|
| LINKS
|
David Cantor, <a href="/A010900/a010900.pdf">Investigation of T-numbers and E-sequences</a>, In Computers in Number Theory, ed. A. O. L. Atkin and B. J. Birch, Acad. Press, NY (1971); pp. 137-140. [Annotated scanned copy]
|
|
| STATUS
|
approved
editing
|
|
|
|
|
|
|
#19 by N. J. A. Sloane at Sun Aug 07 12:33:30 EDT 2016
|
|
|
|
|
|
|
|
#18 by N. J. A. Sloane at Sun Aug 07 12:33:27 EDT 2016
|
|
| FORMULA
|
It is not true that a(n) = a(n-1) + a(n-6), which holds just for n <= 37. (see A275627). E.g. a(38) = 110155 = 85711 + 24445 - 1 = a(37) + a(32) - 1. Sequence is believed to be non-recurring.
|
|
| CROSSREFS
|
Cf. A275627.
|
|
| STATUS
|
approved
editing
|
|
|
|
|
|
|
#17 by N. J. A. Sloane at Sun Aug 07 12:26:24 EDT 2016
|
|
|
|
|
|
|
|
#16 by N. J. A. Sloane at Sun Aug 07 12:26:21 EDT 2016
|
|
| FORMULA
|
It is not true that a(n) = a(n-1) + a(n-6) - e), which holds just for n <= 37. E.g. a(38) = 110155 = 85711 + 24445 - 1 = a(37) + a(32) - 1. Sequence is believed to be non-recurring.
|
|
| STATUS
|
approved
editing
|
|
|
|
|
|
|
#15 by N. J. A. Sloane at Fri Aug 05 16:10:08 EDT 2016
|
|
|
|
|
|
|
|
#14 by N. J. A. Sloane at Fri Aug 05 16:10:05 EDT 2016
|
|
| REFERENCES
|
Cantor, D. G. "Investigation of T-numbers and E-sequences." In Computers in Number Theory, ed. AOL Atkins and BJ Birch, Acad. Press, NY (1971); pp. 137-140.
|
|
| STATUS
|
approved
editing
|
|
|
|
|
|
|
#13 by Bruno Berselli at Thu Jul 28 09:14:42 EDT 2016
|
|
|
|
|
|
|
|
#12 by Bruno Berselli at Thu Jul 28 09:14:38 EDT 2016
|
|
| NAME
|
Pisot sequence E(8,10), a(n)=[ ) = floor( a(n-1)^2/a(n-2)+) + 1/2 ]. ).
|
|
| STATUS
|
proposed
editing
|
|
|
|
|
|
