login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A102460 a(n) = 1 if n is a Lucas number, else a(n) = 0. 17

%I #34 Jul 03 2022 17:31:11

%S 0,1,1,1,1,0,0,1,0,0,0,1,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,

%T 0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,

%U 0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1

%N a(n) = 1 if n is a Lucas number, else a(n) = 0.

%C The number of nonnegative integer solutions to 25*x^4-10*n^2*x^2+n^4-16=0. - _Hieronymus Fischer_, Jul 02 2007

%C a(n)=1 if and only if there is an integer m such that x=n is a root of p(x)=x^4-10*m^2*x^2+25*m^4-16. - _Hieronymus Fischer_, Jul 02 2007

%C For n>=3: a(n)=1 iff floor(log_phi(n+1/2))=ceiling(log_phi(n-1/2)). - _Hieronymus Fischer_, Jul 02 2007

%H Antti Karttunen, <a href="/A102460/b102460.txt">Table of n, a(n) for n = 0..65537</a>

%H Casey Mongoven, <a href="http://caseymongoven.com/catalogue/b199.html">Lucas Binary no. 1</a>; electronic music created with this sequence.

%H <a href="/index/Ch#char_fns">Index entries for characteristic functions</a>

%F G.f.: g(x)=sum{k>=0, x^A000032(k)}. - _Hieronymus Fischer_, Jul 02 2007

%F a(n)=1+floor(arcsinh(n/2)/log(phi))-ceiling(arccosh(n/2)/log(phi)) for n>=3, where phi=(1+sqrt(5))/2. - _Hieronymus Fischer_, Jul 02 2007

%F a(n)=1+A130241(n)-A130242(n) for n>=3. - _Hieronymus Fischer_, Jul 02 2007

%F a(n)=1+A130247(n)-A130242(n) for n=>2. - _Hieronymus Fischer_, Jul 02 2007

%F a(n)=A130245(n)-A130245(n-1) for n>=1. - _Hieronymus Fischer_, Jul 02 2007

%F For n>=3: a(n)=1 iff A130241(n)=A130242(n). - _Hieronymus Fischer_, Jul 02 2007

%t {0}~Join~ReplacePart[ConstantArray[0, Last@ #], Map[# -> 1 &, #]] &@ Array[LucasL, 11, 0] (* _Michael De Vlieger_, Nov 22 2017 *)

%t With[{nn=130,lc=LucasL[Range[0,20]]},Table[If[MemberQ[lc,n],1,0],{n,0,nn}]] (* _Harvey P. Dale_, Jul 03 2022 *)

%o (PARI) a(n)=my(f=factor(25*'x^4-10*n^2*'x^2+n^4-16)[,1]); sum(i=1,#f, poldegree(f[i])==1 && polcoeff(f[i],0)<=0) \\ _Charles R Greathouse IV_, Nov 06 2014

%o (PARI) A102460(n) = { my(u1=1,u2=3,old_u1); if(n<=2,sign(n),while(n>u2,old_u1=u1;u1=u2;u2=old_u1+u2);(u2==n)); }; \\ _Antti Karttunen_, Nov 22 2017

%Y Cf. A000032, A130241, A130242, A130247, A123927.

%Y Cf. partial sums A130245.

%Y Cf. also A010056, A104162, A105348, A147612, A294878.

%K nonn

%O 0,1

%A _Casey Mongoven_, Apr 18 2005

%E Data section extended up to a(123) by _Antti Karttunen_, Nov 22 2017

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 05:49 EDT 2024. Contains 371964 sequences. (Running on oeis4.)