A230560 -id:A230560 - cp's OEIS frontend

A230383 Lexicographically earliest sequence of distinct positive integers such that the first difference contains only distinct positive or negative squares.

1, 2, 6, 5, 14, 10, 26, 17, 42, 78, 29, 4, 53, 37, 101, 20, 120, 56, 137, 16, 160, 60, 24, 145, 314, 25, 221, 52, 277, 21, 310, 85, 341, 197, 521, 80, 441, 41, 482, 121, 605, 76, 476, 152, 681, 105, 730, 54, 630, 146, 822, 38, 767, 142, 926, 1767, 3, 903, 62

Offset: 1

Paul Tek, Oct 17 2013

nonn

Is this a permutation of the positive integers ?

Will every square show up in the first difference ?

			n  a(n)   First difference
-  ----   ----------------
1     1
          +1^2
2     2
          +2^2
3     6
          -1^2
4     5
          +3^2
5    14
          -2^2
6    10
          +4^2
7    26
          ...

Paul Tek, Table of n, a(n) for n = 1..10000
Paul Tek, Perl program for this sequence

Cf. A081145, A175498, A230455, A230560.

Perl
```
See Link section.
```

A230565 a(n)*|a(n)| gives the first difference of A230455.

Original entry on oeis.org

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

Offset: 1

Paul Tek, Oct 23 2013

sign

This sequence contains only terms with distinct absolute values, different from 0.

Paul Tek, Table of n, a(n) for n = 1..10000

Cf. A230455, A230560.

cp's OEIS Frontend

A230383 Lexicographically earliest sequence of distinct positive integers such that the first difference contains only distinct positive or negative squares.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Perl