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

A137894 Limiting sequence when we start with positive integers (A000027) and at step n >= 1 add to the term at position n + a(n) the value n.

Original entry on oeis.org

1, 3, 3, 4, 7, 9, 7, 12, 9, 10, 11, 17, 13, 21, 21, 16, 17, 27, 19, 38, 21, 33, 23, 24, 25, 39, 27, 28, 41, 30, 31, 48, 33, 51, 49, 51, 37, 57, 39, 40, 41, 63, 43, 44, 63, 69, 47, 72, 49, 75, 51, 52, 53, 81, 77, 84, 57, 78, 59, 90, 61, 93, 63, 64, 91, 99, 67, 68, 69, 99
Offset: 1

Views

Author

Ctibor O. Zizka, Apr 30 2008

Keywords

Links

Crossrefs

Cf. A000027, A136119, A137319, A137417, A137418, A136259, A136272.

Programs

  • Maple
    mx:= 10000: # maximal index needed
b:= proc(n) n end:
a:= proc(n) option remember; global mx; local h, t;
      if n=0 then 0 else a(n-1); t:= b(n);
        if n+t<=mx then h:=b(t+n); b(t+n):=h+n fi; t
      fi
    end:
seq(a(n), n=1..100);  # Alois P. Heinz, Mar 04 2015
  • Mathematica
    mx = 10000 (* maximal index needed *); b[n_] := n; a[n_] := a[n] = Module[{h, t}, If[n == 0, 0, a[n-1]; t = b[n]; If[n+t <= mx, h = b[t+n]; b[t+n] = h+n]; t]]; Table[a[n], {n, 1, 100}] (* Jean-François Alcover, Oct 24 2016, after Alois P. Heinz *)
  • Python
    TOP = 1000
a = [1]*TOP
for n in range(1,TOP):
  a[n]=n
for n in range(1,TOP):
  print(str(a[n]),end=',')
  if n+a[n]Alex Ratushnyak, Nov 22 2013

Formula

Limiting sequence when we start with positive integers (A000027) and at step n >= 1 add to the term at position n + a(n) the value n.

Extensions

More terms from Alex Ratushnyak, Nov 22 2013.

A137832 Limiting sequence when we start with the positive integers (A000027) and delete in step n >= 1 the last digit in the term at position n + a(n).

Original entry on oeis.org

1, 3, 4, 5, 7, 8, 10, 11, 1, 1, 1, 16, 1, 1, 1, 21, 2, 23, 2, 25, 2, 27, 2, 29, 3, 31, 3, 3, 34, 3, 3, 37, 3, 3, 40, 4, 43, 44, 45, 47, 48, 49, 5, 51, 52, 53, 5, 5, 56, 57, 5, 5, 6, 61, 6, 6, 6, 65, 6, 67, 69, 7, 7, 72, 7, 7, 75, 76, 7, 7, 79, 8, 82, 83, 84, 8
Offset: 1

Views

Author

Ctibor O. Zizka, Apr 29 2008

Keywords

Examples

			First few steps are:
1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,...
n = 1; delete the last digit in the term at position 1+a(1) = 2: 2;
1,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,...
n = 2; delete the last digit in the term at position 2+a(2) = 5: 6;
1,3,4,5,7,8,9,10,11,12,13,14,15,16,17,18,19,20,...
n = 3; delete the last digit in the term at position 3+a(3) = 7: 9;
1,3,4,5,7,8,10,11,12,13,14,15,16,17,18,19,20,...
n = 4; delete the last digit in the term at position 4+a(4) = 9: 2;
1,3,4,5,7,8,10,11,1,13,14,15,16,17,18,19,20,...
n = 5; delete the last digit in the term at position 5+a(5) = 12: 5;
1,3,4,5,7,8,10,11,1,13,14,1,16,17,18,19,20,...
n = 6; delete the last digit in the term at position 6+a(6) = 14: 8;
1,3,4,5,7,8,10,11,1,13,14,1,16,17,1,19,20,...

Links

Crossrefs

Cf. A137292, A136120, A136119, A136259, A136272, A137319, A137417, A137418.

A137901 Limiting sequence when we start with positive integers (A000027) and at step n >= 1 add to the term at position n + a(n) the value 1.

Original entry on oeis.org

1, 3, 3, 4, 6, 7, 7, 9, 9, 10, 12, 12, 14, 15, 15, 16, 18, 19, 19, 21, 21, 22, 24, 25, 25, 26, 28, 28, 30, 31, 31, 33, 33, 34, 36, 36, 38, 39, 39, 40, 42, 43, 43, 45, 45, 46, 48, 48, 50, 51, 51, 53, 53, 54, 56, 57, 57, 58, 60, 60, 62, 63, 63, 64, 66, 67, 67, 69, 69, 70
Offset: 1

Views

Author

Ctibor O. Zizka, Apr 30 2008

Keywords

Crossrefs

Cf. A000027, A136119, A137319, A137417, A137418, A136259, A136272.

Programs

  • PARI
    lista(nn) = my(va = [1..nn]); for (n=1, nn, my(m = n+va[n]); if (m <= nn, va[m]++)); va; \\ Michel Marcus, Oct 29 2022

Formula

Limiting sequence when we start with positive integers (A000027) and at step n >= 1 add to the term at position n + a(n) the value 1.

Extensions

Entries corrected and extended by Paolo P. Lava, Mar 10 2009
More terms from Michel Marcus, Oct 29 2022

A137902 Limiting sequence when we start with positive integers (A000027) and at step n >= 1 add to the term at position n + a(n) the value 1 if the term is odd, otherwise divide the term by 2.

Original entry on oeis.org

1, 1, 4, 4, 5, 6, 8, 4, 9, 5, 11, 3, 13, 14, 4, 16, 17, 9, 20, 20, 21, 11, 23, 24, 25, 13, 28, 14, 29, 30, 31, 16, 34, 17, 35, 36, 37, 38, 20, 20, 41, 22, 43, 44, 45, 23, 47, 12, 49, 25, 52, 52, 53, 54, 56, 56, 57, 29, 60, 16, 61, 31, 63, 32, 65, 66, 68, 68, 70, 35
Offset: 1

Views

Author

Ctibor O. Zizka, Apr 30 2008

Keywords

Crossrefs

Cf. A000027, A136119, A137319, A137417, A137418, A136259, A136272.

Programs

  • PARI
    lista(nn) = my(va = [1..nn]); for (n=1, nn, my(m = n+va[n]); if (m <= nn, if (va[m] % 2, va[m]++, va[m] /= 2));); va; \\ Michel Marcus, Oct 29 2022

Extensions

More terms from Michel Marcus, Oct 29 2022

A137838 Limiting sequence when we start with the positive integers (A000027) and delete in step n >= 1 the first digit in the term at position n + a(n).

Original entry on oeis.org

1, 3, 4, 5, 7, 8, 10, 11, 2, 13, 4, 5, 16, 7, 8, 19, 21, 2, 23, 4, 5, 6, 7, 8, 29, 0
Offset: 1

Views

Author

Ctibor O. Zizka, Apr 29 2008

Keywords

Examples

			First few steps are:
1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,...
n = 1; delete the first digit in the term at position 1+a(1) = 2: 2;
1,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,...
n = 2; delete the first digit in the term at position 2+a(2) = 5: 6;
1,3,4,5,7,8,9,10,11,12,13,14,15,16,17,18,19,20,...
n = 3; delete the first digit in the term at position 3+a(3) = 7: 9;
1,3,4,5,7,8,10,11,12,13,14,15,16,17,18,19,20,...
n = 4; delete the first digit in the term at position 4+a(4) = 9: 1;
1,3,4,5,7,8,10,11,2,13,14,15,16,17,18,19,20,...
n = 5; delete the first digit in the term at position 5+a(5) = 12: 1;
1,3,4,5,7,8,10,11,2,13,14,5,16,17,18,19,20,...
n = 6; delete the first digit in the term at position 6+a(6) = 14: 1;
1,3,4,5,7,8,10,11,2,13,14,5,16,7,18,19,20,...

Crossrefs

Cf. A137292, A136120, A136119, A136259, A136272, A137319, A137417, A137418.

A137898 Limiting sequence when we start with positive integers (A000027) and at step n >= 1 add to the term at position n + a(n) the value of the term at position n+a(n)+1.

Original entry on oeis.org

1, 5, 3, 4, 5, 21, 15, 17, 9, 21, 11, 12, 13, 14, 15, 16, 17, 37, 19, 20, 21, 68, 23, 75, 51, 81, 55, 57, 29, 93, 63, 65, 33, 69, 35, 36, 37, 77, 39, 81, 41, 85, 43, 44, 45, 93, 47, 48
Offset: 1

Views

Author

Ctibor O. Zizka, Apr 30 2008

Keywords

Crossrefs

Cf. A000027, A136119, A137319, A137417, A137418, A136259, A136272.

Formula

Limiting sequence when we start with positive integers (A000027) and at step n >= 1 add to the term at position n + a(n) the value of the term at position n+a(n)+1.

Extensions

Entries corrected and extended by Paolo P. Lava, Mar 10 2009

A137903 Limiting sequence when we start with positive integers (A000027) and at step n >= 1 add to the term at position n + a(n) the value a(n) if the term is odd, else divide the term by 2.

Original entry on oeis.org

1, 1, 4, 4, 5, 6, 11, 4, 9, 5, 11, 3, 13, 14, 10, 16, 17, 18, 19, 20, 21, 11, 23, 24, 35, 13, 27, 14, 29, 30, 31, 16, 44, 17, 35, 18, 37, 19, 52, 20, 41, 35, 43, 44, 45, 23, 47, 12, 49, 50, 68, 52, 53, 45, 55, 56, 76, 29, 59, 47, 61, 31, 63, 64, 65, 66, 67, 68, 92, 35
Offset: 1

Views

Author

Ctibor O. Zizka, Apr 30 2008

Keywords

Crossrefs

Cf. A000027, A136119, A137319, A137417, A137418, A136259, A136272, A137901, A137902.

Programs

  • PARI
    lista(nn) = my(va = [1..nn]); for (n=1, nn, my(m = n+va[n]); if (m <= nn, if (va[m] % 2, va[m]+=va[n], va[m] /= 2));); va; \\ Michel Marcus, Oct 29 2022

Extensions

Entries corrected and extended by Paolo P. Lava, Mar 10 2009
More terms from Michel Marcus, Oct 29 2022

A138095 Limiting sequence when we start with positive integers (A000027) and at step n >= 1 add: to the term at position n + 1*a(n) the value 1, to the term at position n + 2*a(n) the value 1, ..., to the term at position n + n*a(n) the value 1.

Original entry on oeis.org

1, 3, 3, 4, 6, 7, 7, 10, 10, 10, 12, 14, 14, 15, 15, 17, 18, 19, 20, 23, 22, 22, 25, 24, 25, 27, 29, 30, 32, 32, 31, 32, 34, 35, 39, 36, 38, 39, 41, 42, 43, 43, 45, 46, 46, 46, 48, 52, 51, 53, 51, 52, 55, 55, 56, 59, 57, 60, 63, 62, 62, 64, 63, 65, 66, 68, 69, 70, 72, 71
Offset: 1

Views

Author

Ctibor O. Zizka, May 03 2008

Keywords

Examples

			        n | 1  2  3  4  5  6  7  8  9 10 11 12 13 14 15 16 17 18 19 20
  --------+-----------------------------------------------------------
  Step  1 |    3
  Step  2 |             6        9
  Step  3 |                7       10       13
  Step  4 |                     10          14          17          21
  Step  5 |                              12                18
  Step  6 |                                    14                   22
  Step  7 |                                       15
  Step  8 |                                                   19
  Step  9 |                                                      20
  Step 10 |                                                         23
  --------+-----------------------------------------------------------
     a(n) | 1  3  3  4  6  7  7 10 10 10 12 14 14 15 15 17 18 19 20 23

Crossrefs

Cf. A000027, A136119, A137319, A137417, A137418, A136259, A136272, A137292, A136120, A137832, A137838, A137894, A137898, A137901, A137902, A137903.

Programs

  • PARI
    lista(nn) = my(va = [1..nn]); for (n=1, nn, for (k=1, n, my(j = n+k*va[n]); if (j <= #va, va[j]++); )); va; \\ Michel Marcus, Aug 09 2022

Extensions

Corrected and extended by Michel Marcus, Aug 09 2022

A232271 Start with positive integers (A000027), and at each step n >= 1 subtract from the term at position n + a(n) the value a(n).

Original entry on oeis.org

1, 1, 2, 4, 3, 6, 7, 1, 8, 10, 11, 6, 13, 7, 15, 16, 9, 12, 30, 10, 14, 11, 23, 24, 25, 4, 27, 28, 29, -11, 31, 16, 22, 34, 21, 36, 37, 19, 39, 40, 41, 42, 43, 44, 45, 23, 47, 8, 49, 25, 51, 52, 53, 27, 34, -1, 38, 29, 59, 60, 61, 31, 63, 64, 65, 66, 67, 34, 307, 70, 71
Offset: 1

Views

Author

Alex Ratushnyak, Nov 22 2013

Keywords

Comments

The first 71 terms are correct if the following conjecture is true: n+a(n)<=0 or n+a(n)>71 for n >= 2^30.
The sequence of negative terms begins: -11, -1, -261, -11, -253, -319, -341, -407, -451, -528, -329, -371, -29, -31, -649, -619, -427, -737, -37, ...
Indices of negative terms: 30, 56, 330, 616, 690, 870, 930, 1110, 1230, 1288, 1410, 1590, 1624, 1736, 1770, 1820, 1830, 2010, 2072, ...
Numbers n such that a(n)=n: 1, 4, 6, 7, 10, 11, 13, 15, 16, 23, 24, 25, 27, 28, 29, 31, 34, 36, 37, 39, 40, 41, 42, 43, 44, 45, ...
The sequence of numbers n such that n+a(n)<0 begins: 1485264, 2029290, 6156150, 6872250, 8338512, 8769090, 10420410, 13448490, 16654110, 25894770, ...

Crossrefs

Cf. A000027, A136119, A137319, A137417, A137418, A137894.

Programs

  • Python
    TOP = 2**30  # if enough RAM
a = [1]*TOP
for n in range(1,TOP):
  a[n]=n
for n in range(1,TOP):
  if n+a[n]0: a[n+a[n]] -= a[n]
for n in range(1,1000):
  print(a[n], end=', ')

Extensions

Corrected by Alex Ratushnyak, Dec 28 2013
Showing 1-9 of 9 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.