Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A147693
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A147693 Triangle read by rows: numbers n and prime numbered columns p such that T(n, p) is n mod p. +0
1
0, 1, 0, 0, 1, 1, 2, 0, 0, 0, 1, 1, 1, 2, 0, 0, 2, 3, 1, 1, 0, 4, 2, 0, 1, 0, 3, 1, 2, 1, 4, 0, 0, 0, 2, 5, 1, 1, 1, 3, 6, 2, 0, 0, 2, 4, 0, 3, 1, 1, 0, 0, 1, 4, 2, 0, 1, 1, 2, 5, 3, 1, 2, 2, 3, 6, 4, 0, 0, 0, 3, 4, 7, 5, 1, 1, 1, 4, 5, 8, 6, 2, 0, 0, 2, 0, 6, 9, 7, 3, 1, 1, 0, 1, 0, 10, 8, 4, 2 (list; graph; listen)
OFFSET

2,7

COMMENT

The triangle begins with T(2, 2).

A number p is prime, beginning a new column, iff T(p, k) is nonzero for all k < p; T(p, p) is then 0.

Each row can be produced from the previous row by adding one to each number and resetting to zero any which would equal their column number. A complex pattern emerges if values in the triangle are taken modulo 2.

The triangle begins as so:

[2] 0

[3] 1 0

... 0 1

[5] 1 2 0

... 0 0 1

[7] 1 1 2 0

... 0 2 3 1

... 1 0 4 2

... 0 1 0 3

LINKS

Eric Weisstein's World of Mathematics, Redheffer Matrix

CROSSREFS

Cf. A002321, A083058

Sequence in context: A106405 A089310 A129753 this_sequence A070936 A014081 A091890

Adjacent sequences: A147690 A147691 A147692 this_sequence A147694 A147695 A147696

KEYWORD

easy,nonn,tabf

AUTHOR

Reikku Kulon (reikku(AT)gmail.com), Nov 10 2008

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research