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!)
A289873 Related to perfect Wichmann rulers: a(n) = ( n^2 - (mod(n, 6) - 3)^2 ) / 3. 3

%I #17 Jul 15 2017 02:18:24

%S 1,3,5,7,9,15,21,27,33,39,45,55,65,75,85,95,105,119,133,147,161,175,

%T 189,207,225,243,261,279,297,319,341,363,385,407,429,455,481,507,533,

%U 559,585,615,645,675,705,735,765,799,833,867,901,935,969,1007,1045,1083,1121,1159,1197,1239,1281,1323,1365

%N Related to perfect Wichmann rulers: a(n) = ( n^2 - (mod(n, 6) - 3)^2 ) / 3.

%C Leading term in length A289761 of longest perfect Wichmann ruler with n segments.

%H Hugo Pfoertner, <a href="/A289873/b289873.txt">Table of n, a(n) for n = 2..10001</a>

%F a(n) = A289761(n) - n.

%F G.f.: x^2*(1 + x - x^2)*(1 + x^2 - x^3 + 2*x^4 + x^5) / ((1 - x)^3*(1 + x)*(1 - x + x^2)*(1 + x + x^2)) (conjectured). - _Colin Barker_, Jul 14 2017

%F Can be seen as a family of parabolas p_{n}(x) = (2*n - 3*(1 + x))*(1 + x) evaluated at x = 2*floor(n/6)). - _Peter Luschny_, Jul 14 2017

%p p := (n, x) -> (2*n - 3*(1 + x))*(1 + x):

%p a := n -> p(n, 2*floor(n/6)):

%p seq(a(n), n = 2..64); # _Peter Luschny_, Jul 14 2017

%t Table[(n^2 - (Mod[n, 6] - 3)^2)/3, {n, 2, 64}] (* _Michael De Vlieger_, Jul 14 2017 *)

%Y Cf. A004137, A193802, A193803, A289761.

%Y A014641 is a subsequence.

%K nonn,easy

%O 2,2

%A _Hugo Pfoertner_, Jul 14 2017

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 25 05:56 EDT 2024. Contains 371964 sequences. (Running on oeis4.)