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.

A079716 a(n) = 2*(F(1)^3+F(2)^3+F(3)^3+...+F(p)^3)/(F(1)+F(2)+F(3)+...+F(p)) where p is the n-th prime and F(k) denotes the k-th Fibonacci number.

Original entry on oeis.org

2, 5, 27, 174, 7955, 54378, 2551019, 17482358, 821234595, 264431660859, 1812440734590, 583600131432954, 27416783156825867, 187917427075527110, 8828119011157298499, 2842626904464482727003, 915317035112361317429843, 6273676290103919245031562
Offset: 1

Views

Author

Benoit Cloitre, Feb 16 2003

Keywords

Crossrefs

Formula

a(n) = 2*A005968(prime(n)) / A000071(prime(n)+2) [corrected by Sean A. Irvine, Aug 25 2025].