A330549 Gasket based on primes: take array read by diagonals from Gilbreath conjecture (A036262) and replace all nonzero entries with 0's and all 0's with 1's.

0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1

Offset

0

References

Lakhtakia, Akhlesh. "A simple gasket derived from prime numbers." Computers & graphics 13.1 (1989): 57-58.

Links

Table of n, a(n) for n=0..99.

Example

The original array (before changing the entries) is:
2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101
1 2 2 4 2 4 2 4 6 2 6 4 2 4 6 6 2 6 4 2 6 4 6 8 4 2
1 0 2 2 2 2 2 2 4 4 2 2 2 2 0 4 4 2 2 4 2 2 2 4 2 2
1 2 0 0 0 0 0 2 0 2 0 0 0 2 4 0 2 0 2 2 0 0 2 2 0 0
1 2 0 0 0 0 2 2 2 2 0 0 2 2 4 2 2 2 0 2 0 2 0 2 0 0
1 2 0 0 0 2 0 0 0 2 0 2 0 2 2 0 0 2 2 2 2 2 2 2 0 8
1 2 0 0 2 2 0 0 2 2 2 2 2 0 2 0 2 0 0 0 0 0 0 2 8 8
1 2 0 2 0 2 0 2 0 0 0 0 2 2 2 2 2 0 0 0 0 0 2 6 0 8
1 2 2 2 2 2 2 2 0 0 0 2 0 0 0 0 2 0 0 0 0 2 4 6 8 6
1 0 0 0 0 0 0 2 0 0 2 2 0 0 0 2 2 0 0 0 2 2 2 2 2 4
...

Crossrefs

Cf. A036262, A036261, A330548, A330550, A330551.

Sequence in context: A295662 A367512 A187946 * A342019 A323510 A044938

Adjacent sequences: A330546 A330547 A330548 * A330550 A330551 A330552

Keyword

nonn,tabl

Author

N. J. A. Sloane, Dec 20 2019

Status

approved