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

A285758 A slow relative of Hofstadter's Q sequence.

Original entry on oeis.org

1, 2, 2, 2, 2, 2, 2, 2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 10, 11, 12, 12, 12, 13, 14, 15, 16, 16, 16, 17, 18, 18, 18, 19, 20, 21, 22, 22, 22, 22, 22, 23, 24, 24, 24, 25, 26, 27, 28, 28, 28, 29, 30, 30, 30, 31, 32, 33, 34, 34, 34, 34, 34, 35, 36
Offset: 1

Views

Author

Nathan Fox, Apr 25 2017

Keywords

Comments

a(n) is the solution to the recurrence relation a(n) = a(n-a(n-2)) + a(n-a(n-8)), with the initial conditions: a(1) = 1, a(i) = 2 for 2 <= i <= 8, and a(9) = 3.
The sequence a(n) is monotonic, with successive terms increasing by 0 or 1. So the sequence hits every positive integer.
This sequence can be obtained from A063882 using a construction of Isgur et al.

Links

Crossrefs

Cf. A005185, A063882, A285757, A285759, A285760, A285761, A285762.

Programs

  • Maple
    A285758:=proc(n) option remember: if n <= 0 then 0: elif n = 1 then 1: elif n = 2 then 2: elif n = 3 then 2: elif n = 4 then 2: elif n = 5 then 2: elif n = 6 then 2: elif n = 7 then 2: elif n = 8 then 2: elif n = 9 then 3: else A285758(n-A285758(n-2)) + A285758(n-A285758(n-8)): fi: end:

A285759 a(n) = a(n - 1 - a(n - 1)) + a(n - 1 - a(n - 4)), with a(1) = 1, a(2) = 1, a(3) = 1, a(4) = 2.

Original entry on oeis.org

1, 1, 1, 2, 2, 3, 3, 4, 5, 5, 5, 6, 6, 7, 8, 8, 9, 9, 10, 10, 10, 11, 11, 12, 13, 13, 14, 14, 15, 15, 16, 17, 17, 17, 18, 18, 19, 19, 20, 20, 20, 21, 21, 22, 23, 23, 24, 24, 25, 25, 26, 27, 27, 27, 28, 28, 29, 29, 30, 31, 31, 32, 32, 33
Offset: 1

Views

Author

Nathan Fox, Apr 25 2017

Keywords

Comments

The sequence a(n) is monotonic, with successive terms increasing by 0 or 1. So the sequence hits every positive integer.

Links

Crossrefs

Cf. A005185, A063882, A285757, A285758, A285760, A285761, A285762.

Programs

  • Maple
    A285759:=proc(n) option remember: if n <= 0 then 0: elif n = 1 then 1: elif n = 2 then 1: elif n = 3 then 1: elif n = 4 then 2: else A285759(n-1-A285759(n-1)) + A285759(n-1-A285759(n-4)): fi: end:

A285760 a(n) = a(n - 2 - a(n - 1)) + a(n - 2 - a(n - 4)), with a(1) = 1, a(2) = 1, a(3) = 2, a(4) = 2.

Original entry on oeis.org

1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 5, 5, 6, 7, 7, 7, 8, 8, 8, 9, 9, 10, 11, 11, 12, 12, 13, 13, 14, 14, 14, 15, 15, 16, 16, 16, 17, 17, 18, 19, 19, 20, 20, 21, 21, 22, 23, 23, 23, 24, 24, 25, 25, 26, 27, 27, 27, 28, 28, 28, 29, 29, 30, 31, 31
Offset: 1

Views

Author

Nathan Fox, Apr 25 2017

Keywords

Comments

The sequence a(n) is monotonic, with successive terms increasing by 0 or 1. So the sequence hits every positive integer.

Links

Crossrefs

Cf. A005185, A063882, A285757, A285758, A285759, A285761, A285762.

Programs

  • Maple
    A285760:=proc(n) option remember: if n <= 0 then 0: elif n = 1 then 1: elif n = 2 then 1: elif n = 3 then 2: elif n = 4 then 2: else A285760(n-2-A285760(n-1)) + A285760(n-2-A285760(n-4)): fi: end:

A285761 A slow relative of Hofstadter's Q sequence.

Original entry on oeis.org

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

Views

Author

Nathan Fox, Apr 25 2017

Keywords

Comments

a(n) is the solution to the recurrence relation a(n) = a(n-4-a(n-1)) + a(n-4-a(n-4)), with the initial conditions: a(1) = 1, a(2) = 2, a(3) = a(4) = a(5) = 3, a(6) = a(7) = a(8) = 4, a(9) = a(10) = 5.
The sequence a(n) is monotonic, with successive terms increasing by 0 or 1. So the sequence hits every positive integer.

Links

Crossrefs

Cf. A005185, A063882, A285757, A285758, A285759, A285760, A285762.

Programs

  • Maple
    A285761:=proc(n) option remember: if n <= 0 then 0: elif n = 1 then 1: elif n = 2 then 2: elif n = 3 then 3: elif n = 4 then 3: elif n = 5 then 3: elif n = 6 then 4: elif n = 7 then 4: elif n = 8 then 4: elif n = 9 then 5: elif n = 10 then 5: else A285761(n-4-A285761(n-1)) + A285761(n-4-A285761(n-4)): fi: end:

A285762 A slow relative of Hofstadter's Q sequence.

Original entry on oeis.org

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

Views

Author

Nathan Fox, Apr 25 2017

Keywords

Comments

a(n) is the solution to the recurrence relation a(n) = a(n-12-a(n-3)) + a(n-12-a(n-12)), with a(1) through a(33) as initial conditions.
The sequence a(n) is monotonic, with successive terms increasing by 0 or 1. So the sequence hits every positive integer.
This sequence can be obtained from A285761 using a construction of Isgur et al.

Links

Crossrefs

Cf. A005185, A063882, A285757, A285758, A285759, A285760, A285761.

Programs

  • Maple
    A285762:=proc(n) option remember: if n <= 0 then 0: elif n = 1 then 1: elif n = 2 then 2: elif n = 3 then 3: elif n = 4 then 4: elif n = 5 then 5: elif n = 6 then 6: elif n = 7 then 7: elif n = 8 then 8: elif n = 9 then 9: elif n = 10 then 9: elif n = 11 then 9: elif n = 12 then 9: elif n = 13 then 9: elif n = 14 then 9: elif n = 15 then 9: elif n = 16 then 10: elif n = 17 then 11: elif n = 18 then 12: elif n = 19 then 12: elif n = 20 then 12: elif n = 21 then 12: elif n = 22 then 12: elif n = 23 then 12: elif n = 24 then 12: elif n = 25 then 13: elif n = 26 then 14: elif n = 27 then 15: elif n = 28 then 15: elif n = 29 then 15: elif n = 30 then 15: elif n = 31 then 15: elif n = 32 then 15: elif n = 33 then 15: else A285762(n-12-A285762(n-3)) + A285762(n-12-A285762(n-12)): fi: end:
Showing 1-5 of 5 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.