|
Search: id:A072273
|
|
|
| A072273 |
|
Index of powers of 2 that equal the number of noncongruent roots to the congruence x^2=k (mod n) for (k,n)=1 and assuming solvability. |
|
+0
1
|
|
| 0, 0, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 2, 2, 1, 1, 1, 2, 2, 1, 1, 3, 1, 1, 1, 2, 1, 2, 1, 2, 2, 1, 2, 2, 1, 1, 2, 3, 1, 2, 1, 2, 2, 1, 1, 3, 1, 1, 2, 2, 1, 1, 2, 3, 2, 1, 1, 3, 1, 1, 2, 2, 2, 2, 1, 2, 2, 2, 1, 3, 1, 1, 2, 2, 2, 2, 1, 3, 1, 1, 1, 3, 2, 1, 2, 3, 1, 2, 2, 2, 2, 1, 2, 3, 1, 1, 2, 2, 1, 2, 1, 3, 3
(list; graph; listen)
|
|
|
OFFSET
|
1,8
|
|
|
COMMENT
|
2^a(n) = A060594
|
|
FORMULA
|
a(n) = A005087(n) + i, where i may be 0, 1 or 2 according as 2^j divides n, respectively with j <= 1, j=2 or j>=3, (i.e. i=0 when n is not divisible by 4; i=1 when n is divisible by 4 but not by 8; i=2 when n is divisible by 8).
|
|
MATHEMATICA
|
Log[2, Table[cnt=0; Do[If[Mod[k^2-1, n]==0, cnt++ ], {k, n}]; cnt, {n, 150}]] (Noe)
|
|
CROSSREFS
|
Cf. A060594.
Cf. A046072. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Dec 15 2008]
Sequence in context: A103961 A071891 A046072 this_sequence A157230 A034380 A077479
Adjacent sequences: A072270 A072271 A072272 this_sequence A072274 A072275 A072276
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Lekraj Beedassy (blekraj(AT)yahoo.com), Jul 09 2002
|
|
EXTENSIONS
|
Corrected and extended by T. D. Noe (noe(AT)sspectra.com), Sep 09 2005
|
|
|
Search completed in 0.007 seconds
|
