cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A300889 a(n) is the least positive multiple of n which is a Fibbinary number (A003714).

This page as a plain text file.
%I A300889 #8 Mar 15 2018 06:19:00
%S A300889 1,2,9,4,5,18,21,8,9,10,33,36,65,42,165,16,17,18,133,20,21,66,69,72,
%T A300889 325,130,81,84,145,330,341,32,33,34,1365,36,37,266,273,40,41,42,129,
%U A300889 132,585,138,329,144,1029,650,1173,260,265,162,165,168,513,290,649
%N A300889 a(n) is the least positive multiple of n which is a Fibbinary number (A003714).
%H A300889 Rémy Sigrist, <a href="/A300889/b300889.txt">Table of n, a(n) for n = 1..10000</a>
%F A300889 a(n) = n * A300867(n).
%F A300889 a(2*n) = 2*a(n).
%F A300889 a(n) = n iff n belongs to A003714.
%e A300889 The first terms, alongside their binary representation, are:
%e A300889   n  a(n)    binary(a(n))
%e A300889   -- ----    ------------
%e A300889    1    1           1
%e A300889    2    2          10
%e A300889    3    9        1001
%e A300889    4    4         100
%e A300889    5    5         101
%e A300889    6   18       10010
%e A300889    7   21       10101
%e A300889    8    8        1000
%e A300889    9    9        1001
%e A300889   10   10        1010
%e A300889   11   33      100001
%e A300889   12   36      100100
%e A300889   13   65     1000001
%e A300889   14   42      101010
%e A300889   15  165    10100101
%e A300889   16   16       10000
%e A300889   17   17       10001
%e A300889   18   18       10010
%e A300889   19  133    10000101
%e A300889   20   20       10100
%o A300889 (PARI) a(n) = forstep (k=1, oo, 2, if (bitand(k*n, 2*k*n)==0, return (k*n)))
%Y A300889 Cf. A003714, A300867.
%K A300889 nonn,base
%O A300889 1,2
%A A300889 _Rémy Sigrist_, Mar 14 2018