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!)
 A279286 a(n) = d if the point (d,d) is shared by a record of different Dyck paths in the main diagonal of the diagram of the symmetries of sigma described in A237593. 16
 1, 2, 7, 15, 52, 102, 296, 371, 455, 929, 1853, 2034, 4517, 4797, 5829, 6146, 6948, 17577, 18915, 60349, 78369, 85171, 123788, 128596, 415355, 906771, 1308771, 3329668 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Is this sequence infinite? First differs from A282197 (another version) at a(19). - Omar E. Pol, Feb 08 2017 a(n) = d if the point (d,d) belongs to a vertical-line-segment whose length is a record in the main diagonal of the pyramid described in A245092 (starting from the top). The diagram of the symmetries of sigma is also the top view of the mentioned pyramid. See examples. - Omar E. Pol, Feb 09 2017 LINKS EXAMPLE The first record of height difference is between the levels 1 and 2 of the pyramid (starting from the top), at the point (1,1) of the main diagonal of the top view of the pyramid, so a(1) = 1. The second record of height difference is between the levels 2 and 4, at the point (2,2) of the main diagonal of the top view of the pyramid, so a(2) = 2. The third record of height difference is between the levels 9 and 12, at the point (7,7) of the main diagonal of the top view of the pyramid, so a(3) = 7. The fourth record of height difference is between the levels 20 and 24, at the point (15,15) of the main diagonal of the top view of the pyramid, so a(4) = 15. Illustration of the diagram of the symmetries of sigma (n = 1..16), which is also the top view of the pyramid described in A245092, and it is also a quadrant of the top view of the pyramid described in A244050: .     _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ .    |_| | | | | | | | | | | | | | | | .    |_ _|_| | | | | | | | | | | | | | .    |_ _|  _|_| | | | | | | | | | | | .    |_ _ _|    _|_| | | | | | | | | | .    |_ _ _|  _|  _ _|_| | | | | | | | .    |_ _ _ _|  _| |  _ _|_| | | | | | .    |_ _ _ _| |_ _|_|    _ _|_| | | | .    |_ _ _ _ _|  _|     |  _ _ _|_| | .    |_ _ _ _ _| |      _|_| |  _ _ _| .    |_ _ _ _ _ _|  _ _|    _| | .    |_ _ _ _ _ _| |  _|  _|  _| .    |_ _ _ _ _ _ _| |_ _|  _| .    |_ _ _ _ _ _ _| |  _ _| .    |_ _ _ _ _ _ _ _| | .    |_ _ _ _ _ _ _ _| | .    |_ _ _ _ _ _ _ _ _| ... MATHEMATICA a240542[n_] := Sum[(-1)^(k+1)*Ceiling[(n+1)/k - (k+1)/2], {k, 1, Floor[(Sqrt[8n+1]-1)/2]}] a279286[b_] := Module[{centers={{1, 1}}, acc={1}, k=2, cPrev=1, cCur, len}, While[k<=b, cCur=a240542[k]; If[Last[acc]==cCur, AppendTo[acc, cCur], len=Length[acc]; If[First[Last[centers]]

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 February 25 07:33 EST 2020. Contains 332221 sequences. (Running on oeis4.)