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.

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

This page as a plain text file.
%I A023491 #14 May 28 2019 03:22:53
%S A023491 4,8,11,16,22,31,46,68,103,159,249,394,629,1007,1618,2606,4204,6789,
%T A023491 10971,17737,28684,46396,75055,121424,196450,317844,514263,832075,
%U A023491 1346305,2178346,3524616,5702926,9227505,14930393,24157859,39088212,63246030,102334200
%N A023491 a(n) = b(n) + d(n), where b(n) = (n-th Fibonacci number > 1) and d(n) = (n-th non-Lucas number).
%F A023491 a(n) = A000045(n+3)+A090946(n+2). - _R. J. Mathar_, Feb 01 2019
%K A023491 nonn
%O A023491 0,1
%A A023491 _Clark Kimberling_
%E A023491 Corrected by _Clark Kimberling_, Jan 29 2019