OFFSET
1,1
FORMULA
MAPLE
with(combinat): lucas:= n->fibonacci(n+1)+fibonacci(n-1): n:=1: for k from 1 to 7 do for nonlucas from lucas(k)+1 to lucas(k+1)-1 do printf("%d, ", nonlucas+lucas(n)) :n:=n+1 od od: # C. Ronaldo (aga_new_ac(AT)hotmail.com)
MATHEMATICA
Module[{nn=40, luc, nluc}, luc=LucasL[Range[nn]]; nluc=Complement[Range[ Last[ luc]], luc]; Total/@Thread[{luc, Take[nluc, Length[luc]]}]] (* Harvey P. Dale, May 02 2019 *)
PROG
(Python)
from sympy import lucas
def A022801(n):
def f(x):
if x<=2: return n+1
a, b, c = 1, 3, 0
while b<=x:
a, b = b, a+b
c += 1
return n+1+c
m, k = n+1, f(n+1)
while m != k: m, k = k, f(k)
return m+lucas(n) # Chai Wah Wu, Sep 10 2024
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
EXTENSIONS
Thanks to Karima MOUSSAOUI (bouyao(AT)wanadoo.fr), who noticed that there were two versions of this sequence, differing at about the 22nd term, Feb 28 2004
More terms from Emeric Deutsch, Jan 14 2005
STATUS
approved