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.

Previous Showing 11-20 of 44 results. Next

A205837 Numbers k for which 2 divides s(k)-s(j) for some j

Original entry on oeis.org

3, 4, 4, 5, 6, 6, 6, 7, 7, 7, 7, 8, 8, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14, 15, 15, 15, 15, 15, 15, 15, 15, 15, 16, 16, 16, 16, 16
Offset: 1

Views

Author

Clark Kimberling, Feb 01 2012

Keywords

Comments

For a guide to related sequences, see A205840.

Examples

			The first six terms match these differences:
s(3)-s(1) = 3-1 = 2
s(4)-s(1) = 5-1 = 4
s(4)-s(3) = 5-3 = 2
s(5)-s(2) = 8-2 = 6
s(6)-s(1) = 13-1 = 12
s(6)-s(3) = 13-3 = 10

Crossrefs

Cf. A204892, A205840, A205558.

Programs

  • Mathematica
    s[n_] := s[n] = Fibonacci[n + 1]; z1 = 400; z2 = 60;
f[n_] := f[n] = Floor[(-1 + Sqrt[8 n - 7])/2];
Table[s[n], {n, 1, 30}]
u[m_] := u[m] = Flatten[Table[s[k] - s[j], {k, 2, z1}, {j, 1, k - 1}]][[m]]
Table[u[m], {m, 1, z1}]   (* A204922 *)
v[n_, h_] := v[n, h] = If[IntegerQ[u[h]/n], h, 0]
w[n_] := w[n] = Table[v[n, h], {h, 1, z1}]
d[n_] := d[n] = Delete[w[n], Position[w[n], 0]]
c = 2; t = d[c]           (* A205556 *)
k[n_] := k[n] = Floor[(3 + Sqrt[8 t[[n]] - 1])/2]
j[n_] := j[n] = t[[n]] - f[t][[n]] (f[t[[n]]] + 1)/2
Table[k[n], {n, 1, z2}]     (* A205837 *)
Table[j[n], {n, 1, z2}]     (* A205838 *)
Table[s[k[n]] - s[j[n]], {n, 1, z2}](* A205839 *)
Table[(s[k[n]] - s[j[n]])/c, {n, 1, z2}](* A205840 *)

A205843 The least number j such that 3 divides s(k)-s(j), where k(n)=A205842(n) and s(k) denotes the (k+1)-st Fibonacci number.

Original entry on oeis.org

2, 2, 4, 1, 3, 1, 6, 1, 6, 8, 2, 4, 5, 3, 7, 2, 4, 5, 10, 2, 4, 5, 10, 12, 1, 6, 8, 9, 3, 7, 11, 1, 6, 8, 9, 14, 1, 6, 8, 9, 14, 16, 2, 4, 5, 10, 12, 13, 3, 7, 11, 15, 2, 4, 5, 10, 12, 13, 18, 2
Offset: 1

Views

Author

Clark Kimberling, Feb 01 2012

Keywords

Comments

For a guide to related sequences, see A205840.

Examples

			(See the example at A205842.)

Crossrefs

Cf. A204890, A205842, A205845.

Programs

  • Mathematica
    (See the program at A205842.)

A205848 The least number j such that 4 divides s(k)-s(j), where k(n)=A205847(n) and s(k) denotes the (k+1)-st Fibonacci number.

Original entry on oeis.org

1, 1, 4, 1, 4, 6, 2, 3, 1, 4, 6, 7, 5, 1, 4, 6, 7, 10, 1, 4, 6, 7, 10, 12, 2, 8, 3, 9, 1, 4, 6, 7, 10, 12, 13, 5, 11, 1, 4, 6, 7, 10, 12, 13, 16, 1, 4, 6, 7, 10, 12, 13, 16, 18, 2, 8, 14, 3, 9, 15
Offset: 1

Views

Author

Clark Kimberling, Feb 02 2012

Keywords

Comments

For a guide to related sequences, see A205840.

Examples

			(See the example at A205847.)

Crossrefs

Cf. A204890, A205847, A205850.

Programs

  • Mathematica
    (See the program at A205847.)

A205853 The least number j such that 5 divides s(k)-s(j), where k(n)=A205852(n) and s(k) denotes the (k+1)-st Fibonacci number.

Original entry on oeis.org

3, 3, 5, 1, 4, 8, 8, 10, 3, 5, 6, 2, 4, 9, 2, 13, 2, 13, 15, 8, 10, 11, 1, 7, 4, 9, 14, 1, 7, 18, 1, 7, 18, 20, 2, 13, 15, 16, 3, 5, 6, 12, 4, 9, 14, 19, 3, 5, 6, 12, 23, 3, 5, 6, 12, 23, 25, 1, 7, 18
Offset: 1

Views

Author

Clark Kimberling, Feb 02 2012

Keywords

Comments

For a guide to related sequences, see A205840.

Examples

			(See the example at A205852.)

Crossrefs

Cf. A204890, A205852, A205840.

Programs

  • Mathematica
    (See the program at A205852.)

A205858 The least number j such that 6 divides s(k)-s(j), where k(n)=A205857(n) and s(k) denotes the (k+1)-st Fibonacci number.

Original entry on oeis.org

2, 1, 3, 1, 6, 4, 4, 10, 4, 10, 12, 8, 3, 7, 1, 6, 9, 8, 14, 4, 10, 12, 13, 3, 7, 15, 2, 5, 4, 10, 12, 13, 18, 1, 6, 9, 16, 11, 1, 6, 9, 16, 22, 1, 6, 9, 16, 22, 24, 2, 5, 20, 3, 7, 15, 19, 4, 10, 12, 13
Offset: 1

Views

Author

Clark Kimberling, Feb 02 2012

Keywords

Comments

For a guide to related sequences, see A205840.

Examples

			(See the example at A205857.)

Crossrefs

Cf. A204890, A205857, A205840.

Programs

  • Mathematica
    (See the program at A205857.)

A205863 The least number j such that 7 divides s(k)-s(j), where k(n)=A205862(n) and s(k) denotes the (k+1)-st Fibonacci number.

Original entry on oeis.org

1, 6, 6, 8, 4, 2, 6, 8, 9, 1, 5, 7, 1, 5, 14, 1, 5, 14, 16, 2, 12, 3, 4, 10, 1, 5, 14, 16, 17, 6, 8, 9, 13, 7, 15, 6, 8, 9, 13, 22, 6, 8, 9, 13, 22, 24, 4, 10, 20, 11, 2, 12, 18, 6, 8, 9, 13, 22, 24, 25
Offset: 1

Views

Author

Clark Kimberling, Feb 02 2012

Keywords

Comments

For a guide to related sequences, see A205840.

Examples

			(See the example at A205862.)

Crossrefs

Cf. A204890, A205862, A205840.

Programs

  • Mathematica
    (See the program at A205862.)

A205868 The least number j such that 8 divides s(k)-s(j), where k(n)=A205867(n) and s(k) denotes the (k+1)-st Fibonacci number.

Original entry on oeis.org

4, 4, 6, 2, 1, 5, 1, 10, 1, 10, 12, 2, 8, 3, 4, 6, 7, 5, 11, 4, 6, 7, 16, 4, 6, 7, 16, 18, 2, 8, 14, 9, 1, 10, 12, 13, 5, 11, 17, 1, 10, 12, 13, 22, 1, 10, 12, 13, 22, 24
Offset: 1

Views

Author

Clark Kimberling, Feb 02 2012

Keywords

Comments

For a guide to related sequences, see A205840.

Examples

			(See the example at A205867.)

Crossrefs

Cf. A204890, A205867, A205840.

Programs

  • Mathematica
    (See the program at A205867.)

A205873 The least number j such that 9 divides s(k)-s(j), where k(n)=A205872(n) and s(k) denotes the (k+1)-st Fibonacci number.

Original entry on oeis.org

3, 1, 5, 5, 10, 5, 10, 12, 8, 6, 1, 9, 4, 15, 2, 5, 10, 12, 13, 1, 9, 17, 11, 1, 9, 17, 22, 1, 9, 17, 22, 24, 2, 20, 3, 7, 4, 18, 5, 10, 12, 13, 21, 6, 16, 3, 7, 27, 8, 14
Offset: 1

Views

Author

Clark Kimberling, Feb 02 2012

Keywords

Comments

For a guide to related sequences, see A205840.

Examples

			(See the example at A205872.)

Crossrefs

Cf. A204890, A205872, A205840.

Programs

  • Mathematica
    (See the program at A205872.)

A205878 The least number j such that 10 divides s(k)-s(j), where k(n)=A205877(n) and s(k) denotes the (k+1)-st Fibonacci number.

Original entry on oeis.org

3, 1, 4, 8, 3, 6, 13, 13, 15, 8, 11, 1, 7, 4, 9, 1, 7, 18, 13, 15, 16, 5, 4, 9, 19, 3, 6, 12, 5, 23, 1, 7, 18, 21, 10, 14, 10, 28, 10, 28, 30, 5, 23, 26, 13, 15, 16, 22, 4, 9
Offset: 1

Views

Author

Clark Kimberling, Feb 02 2012

Keywords

Comments

For a guide to related sequences, see A205840.

Examples

			(See the example at A205877.)

Crossrefs

Cf. A204890, A205877, A205840.

Programs

  • Mathematica
    (See the program at A205877.)

A205838 The least number j such that 2 divides s(k)-s(j), where k(n)=A205720(n).

Original entry on oeis.org

1, 1, 3, 2, 1, 3, 4, 1, 3, 4, 6, 2, 5, 1, 3, 4, 6, 7, 1, 3, 4, 6, 7, 9, 2, 5, 8, 1, 3, 4, 6, 7, 9, 10, 1, 3, 4, 6, 7, 9, 10, 12, 2, 5, 8, 11, 1, 3, 4, 6, 7, 9, 10, 12, 13, 1, 3, 4, 6, 7
Offset: 1

Views

Author

Clark Kimberling, Feb 01 2012

Keywords

Comments

For a guide to related sequences, see A205840.

Examples

			(See the example at A205587.)

Crossrefs

Cf. A204890, A205587, A205840.

Programs

  • Mathematica
    (See the program at A205587.)
Previous Showing 11-20 of 44 results. Next

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

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