The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A237292 a(n) = A002326(2n(n+1)) / A002326(n). 2
 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 7, 23, 25, 27, 29, 31, 33, 35, 37, 13, 41, 43, 45, 47, 49, 51, 53, 11, 19, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 101, 103, 35, 107, 109, 37, 113, 115, 117, 119, 121, 123, 125 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS Note that ((2n+1)^2-1)/2 = 2n(n+1). We have 1 <= a(n) <= 2n+1 and a(n) divides 2n+1 for every n >= 0. Odd m is a Wieferich number A182297 if and only if a((m-1)/2) < m. Odd prime p is a Wieferich prime A001220 if and only if a((p-1)/2) = 1. a((n-1)/2) = 1 for n = 1, 1093, 3511, 7651, 10533, 14209, 17555, ... LINKS Robert Israel, Table of n, a(n) for n = 0..10000 FORMULA a(n) = ord_{(2n+1)^2}(2) / ord_{2n+1}(2),  n >= 0. MAPLE 1, seq(numtheory:-order(2, 4*n*(n+1)+1)/numtheory:-order(2, 2*n+1), n=1..100); # Robert Israel, Dec 02 2015 PROG (PARI) a002326(n) = znorder(Mod(2, 2*n+1)); a(n) = a002326(2*n*(n+1))/a002326(n); \\ Michel Marcus, Feb 08 2014 CROSSREFS Cf. A001220, A002326, A077816 and A182297. Sequence in context: A248196 A245234 A160144 * A098729 A160939 A160927 Adjacent sequences:  A237289 A237290 A237291 * A237293 A237294 A237295 KEYWORD nonn AUTHOR Thomas Ordowski, Feb 06 2014 EXTENSIONS More terms from Michel Marcus, Feb 08 2014 Edited by Thomas Ordowski, Dec 02 2015 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 26 00:32 EDT 2020. Contains 334613 sequences. (Running on oeis4.)