reviewed
approved
reviewed
approved
proposed
reviewed
editing
proposed
a := proc(n) local count, lucas, newcas;
count := 0; lucas := 1; newcas := 2;
while lucas < n do
if numtheory:-issqrfree(n - lucas) then count := count + 1 fi;
lucas, newcas := lucas + newcas, lucas;
od;
count end:
seq(a(n), n=1..90); # Peter Luschny, May 15 2018
proposed
editing
editing
proposed
For all n, a(n) <= A130241(n), and for n > 14, a(n) < A130241(n) as A000204(6) = 18 is the first Lucas number that is not squarefree. - Antti Karttunen, May 13 2018
For all n, a(n) <= A130241(n), and for n > 14, a(n) < A130241(n) as A000204(6) = 18 is the first Lucas number that is not squarefree. - Antti Karttunen, May 13 2018
For all n, a(n) <= A130241(n). - Antti Karttunen, May 13 2018
proposed
editing
editing
proposed
Antti Karttunen, <a href="/A304333/b304333.txt">Table of n, a(n) for n = 1..65537</a>
proposed
editing
editing
proposed