A330402 -id:A330402 - cp's OEIS frontend

A330421 Running totals in A330402.

0, 2, 3, 7, 2, 5, 11, 3, 13, 2, 11, 23, 37, 53, 71, 47, 67, 89, 61, 31, 5, 37, 3, 41, 5, 47, 7, 53, 97, 47, 2, 17, 71, 23, 2, 19, 71, 127, 67, 5, 71, 13, 83, 19, 97, 29, 2, 31, 103, 29, 109, 191, 107, 31, 127, 41, 2, 37, 127, 29, 131, 43, 2, 53, 157, 251, 151

Offset: 0

Rémy Sigrist, Dec 14 2019

nonn

All terms, except the first, are prime numbers.

Rémy Sigrist, Table of n, a(n) for n = 0..10000
Rémy Sigrist, PARI program for A330421

Cf. A330402.

PARI
```
See Links section.
```

A330402(n) = abs(a(n) - a(n-1)).

A330401 Lexicographically earliest sequence of distinct positive terms with an associate sequence t such that t(0) = 0, and for any n > 0, at least one of t(n-1) - a(n) or t(n-1) + a(n) is a palindrome; in case t(n-1) - a(n) is a palindrome, set t(n) = t(n-1) - a(n), otherwise set t(n) = t(n-1) + a(n).

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 8, 7, 18, 11, 9, 20, 13, 24, 22, 10, 21, 14, 25, 26, 15, 16, 27, 28, 17, 19, 30, 29, 40, 33, 44, 46, 35, 36, 47, 48, 37, 38, 49, 50, 39, 41, 52, 51, 62, 45, 12, 32, 43, 23, 34, 54, 60, 31, 61, 71, 81, 63, 53, 42, 55, 57, 68, 66, 72, 70, 79

Offset: 1

Rémy Sigrist, Dec 13 2019

This sequence is a variant of A329544.

			The first terms, alongside t(n), are:
  n   a(n)  t(n)
  --  ----  ----
   0  N/A      0
   1     1     1
   2     2     3
   3     3     0
   4     4     4
   5     5     9
   6     6     3
   7     8    11
   8     7     4
   9    18    22
  10    11    11
  11     9     2
  12    20    22

Rémy Sigrist, Table of n, a(n) for n = 1..10000
Rémy Sigrist, PARI program for A330401

See A330402 and A330403 for similar sequences.

Cf. A002113, A329544, A330420 (running totals).

PARI
```
See Links section.
```

cp's OEIS Frontend

A330421 Running totals in A330402.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

Formula