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-1 of 1 results.

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

Original entry on oeis.org

6, 12, 17, 26, 38, 57, 88, 136, 213, 337, 537, 860, 1383, 2227, 3592, 5800, 9372, 15151, 24501, 39629, 64106, 103710, 167791, 271474, 439236, 710680, 1149885, 1860533, 3010385, 4870884, 7881234, 12752082, 20633279, 33385323, 54018563, 87403846, 141422368
Offset: 0

Views

Author

Keywords

Crossrefs

Essentially the same as A022802.

Programs

  • Mathematica
    Module[{nn=40,lnos,non,len},lnos=LucasL[Range[nn]];non= Complement[ Range[ 2*nn],lnos];len=Min[Length[lnos]-2,Length[non]];Total/@ Thread[ {Take[ lnos, {3,len+2}],Take[non,len]}]] (* Harvey P. Dale, Jul 29 2015 *)

Formula

a(n) = A000204(n+3) + A090946(n+1). - Michel Marcus, Jul 30 2015

Extensions

Corrected and extended by Harvey P. Dale, Jul 29 2015
Showing 1-1 of 1 results.