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

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

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

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