Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A066799
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A066799 Square array read by antidiagonals of eventual period of powers of k mod n; period of repeating digits of 1/n in base k. +0
4
1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 4, 1, 1, 1, 2, 1, 4, 2, 1, 1, 1, 1, 1, 2, 1, 3, 1, 1, 1, 1, 1, 1, 1, 6, 1, 1, 1, 1, 2, 2, 1, 2, 3, 2, 6, 1, 1, 1, 1, 1, 4, 1, 6, 1, 1, 4, 1, 1, 1, 1, 1, 4, 1, 2, 2, 3, 4, 10, 1, 1, 1, 2, 1, 2, 2, 1, 1, 6, 2, 5, 2, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 5, 2, 12 (list; table; graph; listen)
OFFSET

1,9

FORMULA

T(n, k)=T(n, k-n) if k>n. T(n, n)=T(n, n+1)=1. T(n, n-1)=2.

EXAMPLE

Rows start: 1,1,1,1,1...; 1,1,1,1,1...; 1,2,1,1,2...; 1,1,2,1,1; 1,4,4,2,1... T(3,2)=2 since the powers of 2 become 1,2,1,2,1,2... mod 3 with period 2. T(4,2)=1 since the powers of 2 become 1,2,0,0,0,0... mod 4 with eventual period 1.

CROSSREFS

Columns are A000012, A007733, A007734, A007735, A007736, A007737, A007738, A007739, A007740, A007732. A002322 is the highest value in each row and the lowest common mulitiple of each row, while the number of distinct values in each row is A066800.

Sequence in context: A095827 A091887 A144871 this_sequence A037832 A039737 A144382

Adjacent sequences: A066796 A066797 A066798 this_sequence A066800 A066801 A066802

KEYWORD

nonn,tabl

AUTHOR

Henry Bottomley (se16(AT)btinternet.com), Dec 20 2001

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 13:47 EST 2009. Contains 167481 sequences.


AT&T Labs Research