The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A333453 Binary concatenation (ignoring leading zeros) of a(n-1) and a(n-2) mod n, starting with a(n) = n for n <= 1. 1
 0, 1, 1, 0, 1, 1, 3, 0, 3, 3, 5, 1, 1, 3, 7, 1, 15, 14, 5, 18, 9, 12, 3, 14, 11, 15, 17, 17, 1, 20, 11, 0, 11, 11, 17, 3, 5, 23, 37, 37, 5, 29, 27, 33, 27, 6, 35, 4, 3, 28, 15, 49, 19, 46, 33, 13, 25, 14, 9, 40, 49, 4, 57, 19, 57, 23, 11, 40, 39, 52, 7, 3, 31 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,7 COMMENTS Value 0 is treated as empty bit string. LINKS Alois P. Heinz, Table of n, a(n) for n = 0..32768 FORMULA a(n) = (a(n-1)*A062383(a(n-2)) + a(n-2)) mod n if n > 1, a(n) = n if n < 2. EXAMPLE a(18) = 5 = 239 mod 18, where 239 = 11101111_2 is the binary concatenation 1110_2 = 14 = a(17) and 1111_2 = 15 = a(16). MAPLE a:= proc(n) option remember; `if`(n<2, n, (t-> a(n-1)*       `if`(t=0, 1, 2^(ilog2(t)+1))+t)(a(n-2)) mod n)     end: seq(a(n), n=0..100); CROSSREFS Cf. A062383, A063896, A079777. Sequence in context: A078907 A282135 A309339 * A278923 A210485 A111815 Adjacent sequences:  A333450 A333451 A333452 * A333454 A333455 A333456 KEYWORD nonn,base AUTHOR Alois P. Heinz, Mar 21 2020 STATUS approved

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

Last modified November 24 06:52 EST 2020. Contains 338607 sequences. (Running on oeis4.)