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!)
A049114 2-ranks of difference sets constructed from Glynn type II hyperovals. 3

%I #14 Sep 08 2022 08:44:58

%S 1,1,5,7,21,37,89,173,383,777,1665,3441,7277,15159,31885,66645,139865,

%T 292757,613823,1285585,2694433,5644609,11828501,24782311,51928773,

%U 108802597,227978105,477674813,1000877759,2097121497,4394101857

%N 2-ranks of difference sets constructed from Glynn type II hyperovals.

%H G. C. Greubel, <a href="/A049114/b049114.txt">Table of n, a(n) for n = 1..1000</a>

%H R. Evans, H. Hollmann, C. Krattenthaler and Q. Xiang, <a href="http://dx.doi.org/10.1006/jcta.1998.2950">Gauss sums, Jacobi sums, and p-ranks of cyclic difference sets</a>, J. Combin. Theory Ser. A, 87.1 (1999), 74-119.

%H Ronald Evans, Henk Hollmann, Christian Krattenthaler, and Qing Xiang, <a href="https://www.mat.univie.ac.at/~kratt/artikel/glynn.html">Supplement to "Gauss Sums, Jacobi Sums and p-ranks ..."</a>

%H Q. Xiang, <a href="https://doi.org/10.1109/18.737547">On Balanced Binary Sequences with Two-Level Autocorrelation Functions</a>, IEEE Trans. Inform. Theory 44 (1998), 3153-3156.

%F G.f.: (1-x+x^2-x^3+x^4)/(1-2*x-2*x^2+4*x^3-x^5).

%F a(n+1) = a(n) + 3*a(n-1) - a(n-2) - a(n-3) + 1.

%p L := 1,1,5,7: for i from 5 to 100 do l := nops([ L ]): L := L,op(l,[ L ])+3*op(l-1,[ L ])-op(l-2,[ L ])-op(l-3,[ L ])+1: od: [ L ];

%t Join[{1,1,5,7}, Table[a[1]=1; a[2]=1; a[3]=5; a[4]=7; a[i]=a[i-1]+ 3*a[i-2]-a[i-3]-a[i-4] +1, {i, 5, 40}]]

%t CoefficientList[Series[(1-x+x^2-x^3+x^4)/(1-2*x-2*x^2+4*x^3-x^5), {x, 0, 40}], x] (* _G. C. Greubel_, Jul 10 2019 *)

%o (PARI) my(x='x+O('x^40)); Vec((1-x+x^2-x^3+x^4)/(1-2*x-2*x^2+4*x^3-x^5)) \\ _G. C. Greubel_, Jul 10 2019

%o (Magma) R<x>:=PowerSeriesRing(Integers(), 40); Coefficients(R!( (1-x+x^2-x^3+x^4)/(1-2*x-2*x^2+4*x^3-x^5) )); // _G. C. Greubel_, Jul 10 2019

%o (Sage) ((1-x+x^2-x^3+x^4)/(1-2*x-2*x^2+4*x^3-x^5)).series(x, 40).coefficients(x, sparse=False) # _G. C. Greubel_, Jul 10 2019

%o (GAP) a:=[1,5,7,21];; for n in [5..40] do a[n]:=a[n-1]+3*a[n-2]-a[n-3] -a[n-4] +1; od; Concatenation([1], a); # _G. C. Greubel_, Jul 10 2019

%Y Cf. A001595, A049112.

%K nonn,easy

%O 1,3

%A Christian Krattenthaler (kratt(AT)ap.univie.ac.at)

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 August 20 07:51 EDT 2024. Contains 375314 sequences. (Running on oeis4.)