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.

Showing 1-2 of 2 results.

A254122 Numbers requiring two Fibonacci numbers to build using + or *.

Original entry on oeis.org

4, 6, 7, 9, 10, 11, 14, 15, 16, 18, 22, 23, 24, 25, 26, 29, 35, 36, 37, 39, 40, 42, 47, 56, 57, 58, 60, 63, 64, 65, 68, 76, 90, 91, 92, 94, 97, 102, 104, 105, 110, 123, 145, 146, 147, 149, 152, 157, 165, 168, 169, 170, 178, 199
Offset: 1

Views

Author

R. J. Mathar, Jan 25 2015

Keywords

Comments

Numbers of the form F(i)+F(k) or F(i)*F(k), F=A000045, but not in A000045 themselves.
Supersequence of A179242; contains also numbers like 5*5=25, 5*8=40, 8*8=64 and 5*13=65. (Note that we count 8 twice in 8*8=64, including its multiplicity.)

Crossrefs

A254123 Least number of terms needed to build n from Fibonacci numbers using + and *.

Original entry on oeis.org

1, 1, 1, 2, 1, 2, 2, 1, 2, 2, 2, 3, 1, 2, 2, 2, 3, 2, 3, 3, 1, 2, 2, 2, 2, 2, 3, 3, 2, 3, 3, 3, 3, 1, 2, 2, 2, 3, 2, 2, 3, 2, 3, 3, 3, 3, 2, 3, 3, 3, 4, 3, 3, 3, 1, 2, 2, 2, 3, 2, 3, 3, 2, 2, 2, 3, 3, 2, 3, 3, 3, 3, 3, 3, 3, 2, 3, 3, 3, 3, 3, 4, 4, 3, 3, 3, 3, 3, 1, 2, 2, 2
Offset: 1

Views

Author

Robert Israel, Jan 25 2015

Keywords

Comments

a(n) = 1 iff n is a Fibonacci number (A000045).
a(n) = 2 iff n is in A254122.
a(A025282(n)) = n.

Examples

			a(40) = 2 because 40 = 5*8; 5 and 8 are Fibonacci numbers but 40 is not.
		

Crossrefs

Programs

  • Maple
    N:= 1000: # to get a(1) to a(N)
    A:= Vector(N):
    for i from 1 do
      f:= combinat:-fibonacci(i);
      if f > N then break fi;
      A[f]:= 1
    od:
    for n from 1 to N do
      if A[n] = 0 then
         m:= floor(n/2);
         r:= min(A[1..m] + A[[seq(n-i,i=1..m)]]);
         for a in select(`<=`, numtheory:-divisors(n) minus {1}, floor(sqrt(n))) do
            r:= min(r, A[a] + A[n/a])
         od:
         A[n]:= r;
      fi
    od:
    seq(A[i],i=1..N);
Showing 1-2 of 2 results.