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.

User: Art DuPre

Art DuPre's wiki page.

Art DuPre has authored 40 sequences. Here are the ten most recent ones:

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.

A214784 Numbers n such that n-4=A214783(n).

Original entry on oeis.org

11, 19, 31, 71, 79, 179, 191, 239, 251, 311, 379, 419, 431, 439, 479, 491, 499, 571, 631, 659, 719, 739, 751, 839, 971, 1019, 1039, 1051, 1171, 1259, 1319, 1451, 1459, 1499, 1531, 1571, 1759, 1811, 1831, 1879, 1979
Offset: 1

Views

Author

Art DuPre, Aug 03 2012

Keywords

Comments

Conjecture: this sequence is the set of n in A214783(n) for which n-4=A214783(n) are all primes.

Crossrefs

Cf. A214783

A214798 Union of A214796 and A214797.

Original entry on oeis.org

19, 31, 37, 43, 59, 67, 71, 73, 79, 83, 97, 163, 167, 173, 179, 193, 223, 227, 251, 257, 271, 277, 283, 313, 317, 367, 397, 419, 439, 443, 463, 467, 479, 499, 571, 587, 599, 607, 613, 643, 647, 653, 659, 683, 719, 727
Offset: 1

Views

Author

Art DuPre, Aug 03 2012

Keywords

Crossrefs

Cf. A214795, A214796, A214797.

A214781 a(n) = smallest k>=2 such that n divides Fibonacci(k-1)+2.

Original entry on oeis.org

2, 4, 2, 4, 5, 10, 6, 0, 10, 7, 0, 10, 12, 22, 8, 0, 16, 10, 11, 28, 0, 0, 9, 0, 48, 40, 34, 22, 0, 34, 0, 0, 0, 16, 28, 10, 36, 0, 18, 0, 18, 0, 17, 0, 34, 22, 14, 0, 54, 148, 16, 40, 52, 34, 0, 0, 11, 0, 0, 34, 28, 0, 0, 0, 68, 0, 21, 16
Offset: 1

Views

Author

Art DuPre, Aug 03 2012

Keywords

Comments

0 is inserted if no such k exists.

Examples

			n=1 divides F(0)+2=2. n=2 divides F(0)+2=2. n=3 divides F(1)+2=3. n=4 divides F(3)+2=4.

Crossrefs

Cf. A157725, A001177, A214782.

Programs

  • PARI
    a(n) = {k = 2; while (((fibonacci(k-1)+2) % n), k++; if (k > 6*n+2 , return(0));); return (k);} \\ Michel Marcus, May 30 2013

A214783 a(n) = smallest k such that n divides Fibonacci(k-1)+3.

Original entry on oeis.org

1, 2, 1, 2, 4, 5, 13, 6, 17, 15, 7, 9, 19, 29, 17, 8, 23, 17, 15, 15, 13, 17, 12, 9, 18, 47, 41, 45, 11, 17, 27, 18, 17, 23, 77, 21, 10, 15, 25, 18, 25, 29, 34, 27, 17, 12, 21, 21, 13, 18, 33, 75, 59, 41, 17, 45, 33, 11, 14, 57, 35, 27, 45, 18, 75, 17
Offset: 1

Views

Author

Art DuPre, Aug 03 2012

Keywords

Examples

			1 divides F(0)+3=3. 2 divides F(1)+3=4. 3 divides F(0)+3=3. 4 divides F(1)+3=4. 5 divides F(3)+3=5.

Links

Crossrefs

Cf. A157726, A001177, A214781, A214782.

Programs

  • Maple
    A214783 := proc(n)
        local k;
        for k from 0 do
                if modp(combinat[fibonacci](k)+3,n) = 0 then
                        return k;
                end if;
        end do:
end proc:
seq(A214783(n),n=1..80) ; # R. J. Mathar, Aug 08 2012

A214782 Numbers n such that n-1 = A214781(n).

Original entry on oeis.org

3, 7, 13, 17, 37, 53, 83, 97, 103, 127, 137, 157, 197, 223, 227, 257, 277, 283, 293, 313, 337, 367, 373, 383, 397, 433, 443, 457, 463, 467, 487, 503, 523, 547, 577, 587, 593, 607, 613, 617, 683, 727, 733, 757, 787, 823, 827, 853, 857, 863, 877, 907, 937, 947, 997
Offset: 1

Views

Author

Art DuPre, Aug 03 2012

Keywords

Comments

These are the primes associated to the appartition, or entry sequence A214781.

Crossrefs

Cf. A214781, A000045, A001175.

A214797 Numbers n such that n+10=A214795(n).

Original entry on oeis.org

37, 43, 67, 73, 83, 97, 163, 167, 173, 193, 223, 227, 257, 277, 283, 313, 317, 367, 397, 443, 463, 467, 587, 607, 613, 643, 647, 653, 683, 727, 733, 787, 887, 907, 937, 947, 983, 1013, 1033, 1063, 1093, 1117
Offset: 1

Views

Author

Art DuPre, Aug 03 2012

Keywords

Comments

It is still a conjecture that these are all primes. This sequence is disjoint from A214796.

Crossrefs

Cf. A214795, A214796, A214798.

A214796 Numbers n such that n-8=A214795(n).

Original entry on oeis.org

19, 31, 59, 71, 79, 179, 251, 271, 419, 439, 479, 499, 571, 599, 659, 719, 739, 751, 1019, 1091, 1171, 1259, 1319, 1399, 1439, 1451, 1459, 1499, 1531, 1559, 1571, 1759, 1811, 1831, 1879, 1931
Offset: 1

Views

Author

Art DuPre, Aug 03 2012

Keywords

Comments

It is still a conjecture that these are all primes.

Crossrefs

Cf. A214795

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

A214794 Numbers n such that n-5=A214793(n).

Original entry on oeis.org

7, 13, 23, 28, 37, 43, 67, 73, 83, 127, 137, 167, 173, 193, 223, 227, 257, 277, 283, 293, 313, 317, 367, 383, 397, 433, 443, 463, 487, 523, 587, 613, 617, 647, 673, 683, 727, 733, 757, 773, 787, 827
Offset: 1

Views

Author

Art DuPre, Aug 03 2012

Keywords

Comments

It is still a conjecture that 28 is the only nonprime in this sequence.

Crossrefs

Cf. A214793

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

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