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

A214791 Numbers n such that n+8 = A214789(n).

Original entry on oeis.org

17, 23, 26, 37, 53, 67, 83, 137, 157, 163, 167, 173, 193, 197, 223, 283, 293, 367, 373, 383, 467, 487, 523, 547, 577, 613, 643, 673, 683, 727, 787, 853, 863, 887, 907, 937, 1033, 1063, 1093
Offset: 1

Views

Author

Art DuPre, Aug 03 2012

Keywords

Comments

This sequence is disjoint from A214790. It is only a conjecture that this sequence consists of primes except for 26.

Links

Crossrefs

Cf. A214789, A214790, A214792

Programs

  • PARI
    is(n)=my(k); while(((Mod([1, 1; 1, 0], n))^k++)[1, 2]!=-8, ); k==n+7 \\ Charles R Greathouse IV, Nov 25 2014

A214790 Numbers n such that A214789(n) = n-6.

Original entry on oeis.org

10, 11, 19, 31, 79, 131, 179, 239, 251, 379, 419, 431, 439, 479, 499, 571, 599, 631, 659, 719, 751, 839, 971, 1019, 1091, 1171, 1259, 1319, 1559, 1619, 1759, 1811, 1831, 1879, 1931, 1979
Offset: 1

Views

Author

Art DuPre, Aug 03 2012

Keywords

Comments

It is still a conjecture that 10 is the only nonprime in this sequence. This sequence is disjoint from A214791.

Crossrefs

Cf. A214789, A214791, A214792.

Programs

  • PARI
    is(n)=my(k); while(((Mod([1, 1; 1, 0], n))^k++)[1, 2]!=-8, ); k==n-7 \\ Charles R Greathouse IV, Nov 25 2014

A214792 Union of A214790 and A214791.

Original entry on oeis.org

10, 11, 17, 19, 23, 26, 31, 37, 53, 67, 79, 83, 131, 137, 157, 163, 167, 173, 179, 193, 197, 223, 239, 251, 283, 293, 367, 373, 379, 383, 419, 431, 439, 467, 479, 487, 499, 523, 547, 571, 577, 599, 613, 631, 643, 659, 673
Offset: 1

Views

Author

Art DuPre, Aug 03 2012

Keywords

Comments

This is the union of the disjoint sequences A214790 and A214791. It is only a conjecture that 10 and 26 are the only nonprimes in this sequence.

Crossrefs

Cf. A214789, A214790, A214791.

A214795 a(n) is the smallest k>=2 such that n divides Fibonacci(k-1)+21.

Original entry on oeis.org

2, 2, 5, 5, 10, 5, 9, 5, 17, 12, 2, 5, 6, 9, 13, 17, 8, 17, 11, 53, 9, 2, 4, 5, 30, 6, 45, 17, 7, 33, 23, 41, 13, 8, 33, 17, 47, 11, 21, 53, 29, 9, 53, 23, 93, 33, 25, 17, 65, 30, 29, 23, 42, 45, 10, 17, 29, 21, 51, 53
Offset: 1

Views

Author

Art DuPre, Aug 03 2012

Keywords

Comments

The n-th entry a(n) means that a(n) is the index of the first term in A000045+21 which n divides.

Crossrefs

Cf. A214789, A213790, A214791, A214792

Programs

  • Mathematica
    skdf[n_]:=Module[{k=2},While[!Divisible[Fibonacci[k-1]+21,n],k++];k]; Array[ skdf,60] (* Harvey P. Dale, Nov 25 2017 *)

Extensions

Definition corrected. - R. J. Mathar, Aug 09 2012
Showing 1-4 of 4 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.