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.

A201010 Integers that can be written as the product and/or quotient of Lucas numbers.

Original entry on oeis.org

1, 2, 3, 4, 6, 7, 8, 9, 11, 12, 14, 16, 18, 19, 21, 22, 23, 24, 27, 28, 29, 31, 32, 33, 36, 38, 41, 42, 44, 46, 47, 48, 49, 54, 56, 57, 58, 62, 63, 64, 66, 69, 72, 76, 77, 81, 82, 84, 87, 88, 92, 93, 94, 96, 98, 99, 107, 108, 112, 114, 116, 121, 123, 124, 126, 128
Offset: 1

Views

Author

Arkadiusz Wesolowski, Jan 08 2013

Keywords

Comments

These numbers do not occur in A178777.
The first 20 terms of this sequence are the same as in A004144 (nonhypotenuse numbers).
Integers of the form A200381(n)/A200381(m) for some m and n.

Examples

			19 is in the sequence because Lucas(9)/Lucas(0)^2 = 19.
		

Crossrefs

Cf. A000032, A200381, A200995, A201011. Subsequence of A178772. Complement of A201012.

Programs

  • Mathematica
    maxTerm = 128; Clear[f]; f[lim_] := f[lim] = (luc = LucasL[Range[0, lim]]; luc = Delete[luc, 2];  last = luc[[-1]]; t = {1}; Do[t2 = luc[[n]]^Range[ Floor[ Log[last] / Log[ luc[[n]] ]]]; s = Select[ Union[ Flatten[ Outer[ Times, t, t2]]], # <= last &]; t = Union[t, s], {n, lim}]; maxIndex = Length[A200381 = t]; Reap[ Do[r = A200381[[n]] / A200381[[m]]; If[IntegerQ[r] && r <= maxTerm, Sow[r]], {n, 1, maxIndex}, {m, 1, maxIndex}]][[2, 1]] // Union); f[5]; f[lim = 10]; While[ Print["lim = ", lim]; f[lim] != f[lim-5], lim = lim+5]; f[lim] (* Jean-François Alcover, Jun 24 2015, after script by T. D. Noe in A200381 *)

A185060 Number of Fibonacci integers in the interval [1, 10^n].

Original entry on oeis.org

10, 88, 534, 2645, 11254, 42735
Offset: 1

Views

Author

Arkadiusz Wesolowski, Dec 25 2012

Keywords

Comments

A Fibonacci integer is an integer in the multiplicative group generated by the Fibonacci numbers. For each fixed epsilon > 0,
exp(C*(log(10^n))^1/2 - (log(10^n))^epsilon) < a(n) < exp(C*(log(10^n))^1/2 + (log(10^n))^(1/6+epsilon)) for x sufficiently large, where C = 2*zeta(2)*sqrt(zeta(3)/(zeta(6)*log((1 + sqrt(5))/2))) = 5.15512.... (Luca, Pomerance, Wagner (2010))
The old entry a(4) = 2681 was the result of an incorrect calculation by Luca, Pomerance and Wagner. - Arkadiusz Wesolowski, Feb 05 2013

Crossrefs

Programs

  • Mathematica
    e = 4; (*lst1=the terms of A178762 that are smaller than 10^e*); lst1 = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 41, 47, 61, 89, 107, 199, 211, 233, 281, 421, 521, 1103, 1597, 2161, 2207, 2521, 3001, 3571, 5779, 9349, 9901}; lst2 = {}; q = Times @@ Complement[Prime@Range[10^e], lst1]; Do[If[GCD[q, n] == 1, AppendTo[lst2, n]], {n, 10^e}]; Table[Length@Select[lst2, # <= 10^d &], {d, e}] (* Arkadiusz Wesolowski, Feb 05 2013 *)

Extensions

a(4) corrected by T. D. Noe and Arkadiusz Wesolowski, Feb 05 2013
a(5)-a(6) from Arkadiusz Wesolowski, Feb 06 2013
Showing 1-2 of 2 results.