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.

A023493 a(n) = b(n) + d(n), where b(n) = (n-th Lucas number > 1) and d(n) = (n-th non-Lucas number).

This page as a plain text file.
%I A023493 #14 May 28 2019 03:23:34
%S A023493 5,9,13,19,27,39,59,89,137,214,338,538,862,1384,2228,3593,5801,9373,
%T A023493 15152,24502,39630,64107,103712,167792,271475,439237,710681,1149886,
%U A023493 1860534,3010386,4870885,7881235,12752083,20633280,33385324,54018564,87403847,141422369
%N A023493 a(n) = b(n) + d(n), where b(n) = (n-th Lucas number > 1) and d(n) = (n-th non-Lucas number).
%F A023493 a(n) = A000032(n+2)+A090946(n+2). - _R. J. Mathar_, Feb 01 2019
%K A023493 nonn
%O A023493 0,1
%A A023493 _Clark Kimberling_
%E A023493 Corrected by _Clark Kimberling_, Jan 29 2019