|
Search: id:A100836
|
|
|
| A100836 |
|
a(n) = smallest value k > 1 such that k^2-1 is divisible by n^2. |
|
+0 1
|
|
| 2, 3, 8, 7, 24, 17, 48, 31, 80, 49, 120, 17, 168, 97, 26, 127, 288, 161, 360, 49, 197, 241, 528, 127, 624, 337, 728, 97, 840, 199, 960, 511, 485, 577, 99, 161, 1368, 721, 170, 351, 1680, 197, 1848, 241, 649, 1057, 2208, 127, 2400, 1249, 577, 337, 2808, 1457, 1451
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
EXAMPLE
|
a(4)=7 because 7^2-1 is divisible by 4^2 (and 7 is the smallest integer > 1 that fits this equation)
|
|
PROGRAM
|
PARI program from Max Alekseyev, Nov 21 2008:
{ A100836(n)=local(f, b, t, m); if(n==1, return(1)); if(n==2, return(3));
t=valuation(n, 2); if(n==2^t, return(2^(2*t-1)-1)); f=factorint(n/2^t);
f=vector(matsize(f)[1], j, f[j, 1]^(2*f[j, 2]));
if(t>0, f=concat(f, [2^(2*t-1)])); b=n^2+1; forvec(v=vector(#f, i, [0, 1]),
m=lift(chinese(vector(#f, j, Mod((-1)^v[j], f[j])))); if(m>1,
b=min(b, m)); ); b }
|
|
CROSSREFS
|
Sequence in context: A109230 A036970 A110144 this_sequence A100805 A068800 A114585
Adjacent sequences: A100833 A100834 A100835 this_sequence A100837 A100838 A100839
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Thomas Kerscher (Thomas.Kerscher(AT)web.de), Jan 19 2005
|
|
EXTENSIONS
|
Entries confirmed by Ray Chandler, Richard Mathar and Max Alekseyev, Nov 21 2008
|
|
|
Search completed in 0.002 seconds
|