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

A073658 Rearrangement of squares such that sum of two consecutive terms is a prime.

Original entry on oeis.org

1, 4, 9, 64, 25, 16, 81, 100, 49, 144, 169, 400, 121, 36, 361, 196, 225, 484, 289, 324, 529, 900, 841, 256, 625, 576, 1225, 676, 441, 1156, 1521, 1600, 1089, 784, 1369, 1024, 729, 2500, 961, 1936, 1681, 2116, 2401, 1296, 4225, 1444, 2025, 2704, 3249, 4624
Offset: 1

Views

Author

Amarnath Murthy, Aug 10 2002

Keywords

Crossrefs

Programs

  • Mathematica
    mx = 100; free = Range[2, mx]^2; t = {1}; While[i = 1; While[i <= Length[free] && ! PrimeQ[t[[-1]] + free[[i]]], i++]; i <= Length[free], AppendTo[t, free[[i]]]; free = Delete[free, i]]; t (* T. D. Noe, Dec 18 2012 *)

Extensions

More terms from Jason Earls, Aug 25 2002

A073656 Rearrangement of Fibonacci numbers such that sum of two consecutive terms is a prime.

Original entry on oeis.org

1, 1, 2, 3, 8, 5, 144, 13, 34, 55
Offset: 1

Views

Author

Amarnath Murthy, Aug 10 2002

Keywords

Comments

a(11) = F(67671), the 67671st Fibonacci number. This has over 14000 decimal digits and is too large to display here. - Ryan Propper, Jun 16 2006

Crossrefs

Programs

  • Mathematica
    l = {1, 1}; Do[k = 1; While[MemberQ[l, Fibonacci[k]] || !PrimeQ[Last[l] + Fibonacci[k]], k++ ]; AppendTo[l, Fibonacci[k]]; Print[l], {n, 9}] (* Ryan Propper, Jun 16 2006 *)
Showing 1-2 of 2 results.