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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A272911 Difference sequence of the sequence the increasing sequence of products of two Lucas numbers A000032. 1
 2, 1, 3, 2, 2, 1, 4, 2, 3, 7, 1, 4, 11, 3, 2, 5, 18, 4, 1, 10, 29, 5, 2, 3, 15, 47, 10, 1, 4, 25, 76, 15, 3, 2, 5, 40, 123, 25, 4, 1, 10, 65, 199, 40, 5, 2, 3, 15, 105, 322, 65, 10, 1, 4, 25, 170, 521, 105, 15, 3, 2, 5, 40, 275, 843, 170, 25, 4, 1, 10, 65 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Conjecture: every term is a product of two Lucas numbers or a product of two Fibonacci numbers. LINKS Clark Kimberling, Table of n, a(n) for n = 1..1000 MATHEMATICA z = 100; t = Take[Sort[Flatten[Table[LucasL[m] LucasL[n], {n, 1, z}, {m, n, z}]]], 1000]; Differences[t] CROSSREFS Cf. A000032, A000045, A272909, A272912. Sequence in context: A374999 A374997 A339399 * A371014 A284267 A296525 Adjacent sequences: A272908 A272909 A272910 * A272912 A272913 A272914 KEYWORD nonn,easy AUTHOR Clark Kimberling, May 10 2016 STATUS approved

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.

Last modified August 13 11:02 EDT 2024. Contains 375130 sequences. (Running on oeis4.)