The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A023499 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing all changes.

A023499

a(n) = b(n) + d(n), where b(n) = ( (n+1)st Fibonacci number) and d(n) = (n-th number that is 1, 2, or 3, or is not a Lucas number).
(history; published version)

#5 by Harvey P. Dale at Thu Mar 14 17:43:19 EDT 2013

STATUS

editing

approved

#4 by Harvey P. Dale at Thu Mar 14 17:43:12 EDT 2013

MATHEMATICA

Module[{nn=50, nlu, fib=Fibonacci[Range[2, nn+1]], len}, nlu=Join[{1, 2, 3}, Complement[ Range[4, nn], LucasL[Range[nn]]]]; len=Min[nn, Length[nlu]]; Total/@Thread[{Take[fib, len], Take[nlu, len]}]] (* Harvey P. Dale, Mar 14 2013 *)

STATUS

approved

editing

#3 by Russ Cox at Fri Mar 30 18:55:52 EDT 2012

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

Clark Kimberling

Discussion

Fri Mar 30

18:55

OEIS Server: https://oeis.org/edit/global/285

#2 by N. J. A. Sloane at Fri May 16 03:00:00 EDT 2003

NAME

a(n) = b(n) + d(n), where b(n) = ( (n+1)st Fibonacci number) and d(n) = (nth n-th number that is 1, 2, or 3, or is not a Lucas number).

KEYWORD

nonn,new

nonn

AUTHOR

Clark Kimberling (ck6@cedar.(AT)evansville.edu)

#1 by N. J. A. Sloane at Sun Jun 14 03:00:00 EDT 1998

NAME

a(n) = b(n) + d(n), where b(n) = ( (n+1)st Fibonacci number) and d(n) = (nth number that is 1, 2, or 3, or is not a Lucas number).

DATA

2, 4, 6, 10, 14, 21, 30, 44, 67, 102, 158, 248, 393, 627, 1006, 1617, 2605, 4203, 6788, 10970, 17736, 28683, 46395, 75053, 121423, 196449, 317843, 514262, 832074, 1346304, 2178345, 3524615, 5702925, 9227504, 14930392, 24157858

OFFSET

0,1

REFERENCES

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6@cedar.evansville.edu)

STATUS

approved