OFFSET
1,1
COMMENTS
Conjecture: the sequence is infinite.
See the reference for a similar problem with Fibonacci numbers.
The corresponding integers k are 1, 2, 3, 4, 7, 14, 32, 39, 71, 142, 465, ... (see A265742).
For k > 1, the interval [e*k - 1/k, e*k + 1/k] contains exactly one integer.
We observe two properties:
(1) a(n) = m*a(n-m+1) for some n, m=2,3,4.
Examples:
m = 2 => a(7)=2*a(6), a(11)=2*a(10), a(15)=2*a(14), a(20)=2*a(19), a(25)=2*a(24), a(30)=2*a(29), ...
m = 3 => a(16)=3*a(14), a(21)=3*a(19), a(26)=3*a(24), a(31)=3*a(29), ...
m = 4 => a(4)=4*a(1), ...
(2) a(n+2) = a(n) + a(n+1) for n = 1, 2, 4, 8, 12, 14, 17, 19, 22, 24, 27, 29, ...
LINKS
Takao Komatsu, The interval associated with a Fibonacci number, The Fibonacci Quarterly, Volume 41, Number 1, February 2003.
EXAMPLE
For k=1, there exist two integers, a(1)=2 and a(2)=3, in the interval [1*e - 1/1, 1*e + 1/1] = [1.71828..., 3.71828...];
for k=2, the number a(3)=5 belongs to the interval [2*e - 1/2, 2*e + 1/2] = [4.93656..., 5.93656...];
for k=3, the number a(4)=8 belongs to the interval [3*e - 1/3, 3*e + 1/3] = [7.82151..., 8.48817...].
MAPLE
# the program gives the interval [a, b], a(n) and k
nn:=10^7:
e:=exp(1):
for n from 1 to nn do:
x1:=evalhf(e*n-1/n):y1:=evalhf(e*n+1/n):
x:=floor(x1):y:=floor(y1):
for j from x+1 to y do:
# printf("%g %g %d %d\n", x1, y1, j, n):
printf("%d\n", x1, y1, j, n):
od:
od:
CROSSREFS
KEYWORD
nonn
AUTHOR
Michel Lagneau, Dec 15 2015
EXTENSIONS
a(32)-a(33) corrected by and more terms from Jinyuan Wang, Jul 16 2025
STATUS
approved
