The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A022441

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A022441

a(n) = c(n) + c(n-1) where c (A055562) is the sequence of numbers not in a.
(history; published version)

#45 by Charles R Greathouse IV at Thu Sep 08 08:44:46 EDT 2022

PROG

(MAGMAMagma) [1] cat [3*n + 2 - (Floor((Log(n)/Log(2))) mod 2): n in [0..10]]; // G. C. Greubel, Mar 08 2018

Discussion

Thu Sep 08

08:44

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

#44 by Peter Luschny at Sat Mar 24 06:19:00 EDT 2018

STATUS

editing

approved

#43 by Peter Luschny at Sat Mar 24 06:17:14 EDT 2018

MAPLE

A022441 := n-> `if`(n=0, 1, 3*n + 2 - (floor(evalf(lnilog2(n)/ln(2))) mod 2); ):

seq(A022441(n), n= 0..59);

STATUS

reviewed

editing

#42 by G. C. Greubel at Fri Mar 23 20:13:17 EDT 2018

STATUS

proposed

reviewed

#41 by Jon E. Schoenfield at Mon Mar 19 20:13:39 EDT 2018

STATUS

editing

proposed

#40 by Jon E. Schoenfield at Mon Mar 19 20:13:36 EDT 2018

FORMULA

a(n) + a(n-1) = 3n + 2 - ( floor(log_2 n) mod 2) for n >= 1. - Jeffrey Shallit, Jun 08 2000

STATUS

proposed

editing

#39 by Altug Alkan at Mon Mar 19 12:10:25 EDT 2018

STATUS

editing

proposed

#38 by Altug Alkan at Mon Mar 19 12:10:19 EDT 2018

COMMENTS

a(n) = A210770(2*n+1). - Reinhard Zumkeller, Mar 25 2012

FORMULA

a(n) = A210770(2*n+1). - Reinhard Zumkeller, Mar 25 2012

STATUS

proposed

editing

#37 by Michel Marcus at Sun Mar 18 14:14:12 EDT 2018

STATUS

editing

proposed

#36 by Michel Marcus at Sun Mar 18 14:14:06 EDT 2018

LINKS

J-P. Bode, H. Harborth, C. Kimberling, <a href="https://www.fq.math.ca/Papers1/45-3/bode.pdf">Complementary Fibonacci sequences</a>, Fibonacci Quarterly 45 (2007), 254-264.

STATUS

proposed

editing