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.

A107258 Numbers not representable as Fibonacci(i) + triangular(j), i,j>=0.

Original entry on oeis.org

25, 32, 43, 51, 52, 54, 59, 64, 72, 73, 75, 77, 82, 84, 85, 88, 97, 98, 101, 102, 103, 109, 111, 114, 115, 116, 119, 124, 127, 129, 130, 131, 132, 135, 140, 142, 143, 148, 151, 152, 162, 163, 164, 168, 169, 177, 178, 181, 182, 183, 185, 186, 188, 196, 197
Offset: 1

Views

Author

Ralf Stephan, May 15 2005

Keywords

Comments

A107259(a(n)) = 0.

Programs

  • Mathematica
    With[{nn=200},Select[Complement[Range[nn],Union[Flatten[Outer[Plus, Join[{0},Fibonacci[Range[12]]],Accumulate[Range[19]]]]]],#Harvey P. Dale, Jul 15 2012 *)

A181325 Primes that can be written as the sum of a Fibonacci number (A000045) and a triangular number (A000217).

Original entry on oeis.org

2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 47, 53, 61, 67, 71, 79, 83, 89, 107, 113, 137, 139, 149, 157, 167, 173, 179, 191, 193, 199, 211, 223, 233, 239, 269, 277, 281, 311, 313, 331, 353, 359, 379, 383, 389, 397, 409, 419, 433, 443, 461, 467, 499, 509
Offset: 0

Views

Author

Jonathan D. B. Hodgson, Oct 13 2010

Keywords

Examples

			29 is in the sequence since 29 is prime and 29 = 21 + 8 = T(6) + F(7); 43 is not in the sequence, despite being prime, since there exist no m and n such that 43 = T(m) + F(n).
		

Crossrefs

Showing 1-2 of 2 results.