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.

A191929 Ordered sums f+4g, where f and g are Lucas numbers (A000032 beginning at 1).

This page as a plain text file.
%I A191929 #12 Feb 11 2020 02:13:35
%S A191929 5,7,8,11,13,15,16,17,19,20,22,23,27,29,30,31,32,33,34,35,39,41,45,46,
%T A191929 47,48,51,55,57,59,62,63,73,75,76,79,80,83,88,90,91,92,101,104,117,
%U A191929 119,120,123,127,134,135,139,145,148,151,163,167,189,191,192,195
%N A191929 Ordered sums f+4g, where f and g are Lucas numbers (A000032 beginning at 1).
%t A191929 c = 1; d = 4; f[n_] := LucasL[n];
%t A191929 g[n_] := c*f[n]; h[n_] := d*f[n];
%t A191929 t[i_, j_] := h[i] + g[j];
%t A191929 u = Table[t[i, j], {i, 1, 20}, {j, 1, 20}];
%t A191929 v = Union[Flatten[u]]    (* A191929 *)
%t A191929 t1[i_, j_] := If[g[i] - h[j] > 0, g[i] - h[j], 0]
%t A191929 u1 = Table[t1[i, j], {i, 1, 20}, {j, 1, 20}];
%t A191929 v1 = Union[Flatten[u1]]  (* A191930: c*f(i)-d*f(j) *)
%t A191929 g1[n_] := d*f[n]; h1[n_] := c*f[n];
%t A191929 t2[i_, j_] := If[g1[i] - h1[j] > 0, g1[i] - h1[j], 0]
%t A191929 u2 = Table[t2[i, j], {i, 1, 20}, {j, 1, 20}];
%t A191929 v2 = Union[Flatten[u2]]  (* A191931: d*f(i)-c*f(j) *)
%t A191929 v3 = Union[v1, v2]       (* A191932 *)
%Y A191929 Cf. A000032, A191932, A191931, A191932, A191850.
%K A191929 nonn
%O A191929 1,1
%A A191929 _Clark Kimberling_, Jun 19 2011