Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A098867
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A098867 Table(n,2) read by rows such that : 2^(k*(T(n,1)-1))+T(n,2))-1 is 0 mod(T(n,1)) for all integer k >= 0. +0
1
3, 0, 7, 3, 23, 11, 31, 5, 31, 25, 47, 23, 127, 7, 127, 35, 127, 49, 127, 77, 127, 91, 127, 119, 167, 83, 223, 37, 223, 185, 233, 29, 233, 87, 233, 145, 233, 203, 263, 131, 359, 179, 383, 191, 431, 43, 431, 129, 431, 301, 431, 387, 439, 73, 439, 365, 479, 239, 503 (list; table; graph; listen)
OFFSET

1,1

EXAMPLE

2^(1*(7-1)+3) -1 = 511 = 7*73

2^(2*(7-1)+3) -1 = 32767 = 7*4681

2^(3*(7-1)+3) -1 = 2097151 = 7*299593

2^(k*(7-1)+3) -1 = x = 7*j for n=2 T(2,1)=7 T(2,2)=3

CROSSREFS

Adjacent sequences: A098864 A098865 A098866 this_sequence A098868 A098869 A098870

Sequence in context: A011080 A021769 A010600 this_sequence A062253 A065419 A019092

KEYWORD

nonn,tabl

AUTHOR

Pierre CAMI (pierrecami(AT)tele2.fr), Nov 03 2004

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 October 7 14:39 EDT 2008. Contains 144666 sequences.


AT&T Labs Research