login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A332575 Least start of a run of exactly n consecutive numbers that are norm-abundant in Gaussian integers (A332570). 0
2, 9, 4, 12, 24, 185, 114, 1649, 692, 4977, 1412, 416345, 22624, 72233, 199892, 25262152, 1351880, 130824185, 16305324, 1688906313, 9412730, 10393378914, 721753400 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
EXAMPLE
a(2) = 9 since 9 and 10 are the least pair of 2 consecutive numbers that are norm-abundant in Gaussian integers, and 8 and 11 are not norm-abundant.
MATHEMATICA
normAbQ[z_] := Abs[DivisorSigma[1, z, GaussianIntegers -> True]]^2 > 2*Abs[z]^2; n = 1; count = 0; max = 15; seq = Table[0, {max}]; While[count < max, n1 = n; If[normAbQ[n], While[normAbQ[++n1]]; d = n1 - n; If[d <= max && seq[[d]] == 0, count++; seq[[d]] = n]]; n = n1 + 1]; seq
CROSSREFS
Sequence in context: A021343 A200703 A342663 * A080803 A370500 A339316
KEYWORD
nonn,more
AUTHOR
Amiram Eldar, Feb 16 2020
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 16 07:57 EDT 2024. Contains 371698 sequences. (Running on oeis4.)