A086283 -id:A086283 - cp's OEIS frontend

A008344 a(1)=0; thereafter a(n+1) = a(n) - n if a(n) >= n otherwise a(n+1) = a(n) + n.

0, 1, 3, 0, 4, 9, 3, 10, 2, 11, 1, 12, 0, 13, 27, 12, 28, 11, 29, 10, 30, 9, 31, 8, 32, 7, 33, 6, 34, 5, 35, 4, 36, 3, 37, 2, 38, 1, 39, 0, 40, 81, 39, 82, 38, 83, 37, 84, 36, 85, 35, 86, 34, 87, 33, 88, 32, 89, 31, 90, 30, 91, 29, 92, 28, 93, 27, 94, 26, 95, 25, 96, 24, 97, 23, 98

Offset: 1

N. J. A. Sloane

p^a(n) = A084110(p^(n-1)) for n>1 and p prime. - Reinhard Zumkeller, May 12 2003
For n > 1: a(A029858(n)) = A029858(n) and a(A003462(n)) = 0. - Reinhard Zumkeller, May 09 2012
Absolute first differences of A085059; abs(a(n+1)-a(n)) = n, see also A086283. - Reinhard Zumkeller, Oct 17 2014
For n>3, when a(n) = 3, a(n+1) is in A116970. - Bill McEachen, Oct 03 2023

N. J. A. Sloane, Table of n, a(n) for n = 1..29524 (Up to the 10th 0 term)
Index entries for sequences related to Recamán's sequence

Cf. A046901, A008343, A088230, A085059, A086283.
Equals A085059(n)-1.
Cf. A076042 (based on squares).

a008344 n = a008344_list !! (n-1)
a008344_list = 0 : f 0 [1..] where
   f x (z:zs) = y : f y zs where y = if x < z then x + z else x - z
-- Reinhard Zumkeller, Oct 17 2014, May 08 2012

A008344 := proc(n) option remember; if n = 0 then 0 elif A008344(n-1) >= (n-1) then A008344(n-1)-(n-1) else A008344(n-1)+(n-1); fi; end;

a[1]=0; a[n_] := a[n]=If[a[n-1]>=n-1, a[n-1]-n+1, a[n-1]+n-1]
Transpose[ NestList[ If[First[#]>=Last[#],{First[#]-Last[#],Last[#]+1}, {First[#]+Last[#],Last[#]+1}]&,{0,1},80]][[1]] (* Harvey P. Dale, Jun 20 2011 *)
s = 0; Table[If[s < n, s = s + n, s = s - n], {n, 0, 80}] (* Horst H. Manninger, Dec 03 2018 *)

a(n) = my(expo = logint(2*n+1, 3), res = n - (3^expo-1)/2); if(res==0, 0, if(res%2, (3^expo-res)/2, 3^expo-1+res/2)) \\ Jianing Song, May 25 2021

This is a concatenation S_0, S_1, S_2, ... where S_i = [b_0, b_1, ..., b_{3^(i+1)-1}] with b_0 = 0, b_{2j-1} = k+1-j, b_{2j} = 2k+j (j=1..k), k=(3^(i+1)-1)/2. E.g. S_0 = [0, 1, 3], S_1 = [0, 4, 9, 3, 10, 2, 11, 1, 12].
a((3^n-1)/2) = 0; a((3^n-1)/2 + 2k-1) = (3^n+1)/2 - k for 1 <= k <= (3^n-1)/2; a((3^n-1)/2 + 2k) = 3^n - 1 + k for 1 <= k < (3^n-1)/2. - Benoit Cloitre, Jan 09 2003 [Corrected by Jianing Song, May 25 2021]
a(n) = (n-1+a(n-1)) mod (2*(n-1)). - Jon Maiga, Jul 09 2021

Name edited by Dmitry Kamenetsky, Feb 14 2017

A050407 a(n) = n(n^2 - 6n + 11)/6.

Original entry on oeis.org

0, 1, 1, 1, 2, 5, 11, 21, 36, 57, 85, 121, 166, 221, 287, 365, 456, 561, 681, 817, 970, 1141, 1331, 1541, 1772, 2025, 2301, 2601, 2926, 3277, 3655, 4061, 4496, 4961, 5457, 5985, 6546, 7141, 7771, 8437, 9140, 9881, 10661, 11481, 12342, 13245, 14191

Offset: 0

Klaus Strassburger (strass(AT)ddfi.uni-duesseldorf.de), Dec 22 1999

Number of invertible shuffles of n-2 cards. - Adam C. McDougall (mcdougal(AT)stolaf.edu) and David Molnar (molnar(AT)stolaf.edu), Apr 09 2002
If Y is a 3-subset of an n-set X then, for n>=3, a(n-2) is the number of (n-3)-subsets of X which have neither one element nor two elements in common with Y. - Milan Janjic, Dec 28 2007
Let A be the Hessenberg n X n matrix defined by: A[1,j]=j mod 2, A[i,i]:=1, A[i,i-1]=-1, and A[i,j]=0 otherwise. Then, for n>=4, a(n+1)=-coeff(charpoly(A,x),x^(n-3)). - Milan Janjic, Jan 24 2010
Starting with offset 3: (1, 2, 5, 11, 21, ...) = triangle A144257 * [1,2,3,...]. - Gary W. Adamson, Feb 18 2010
(1 + 2x + 5x^2 + 11x^3 + ...) = (1 + 2x + 3x^2 + ...)*(1 + 2x^2 + 3x^3 + ...). - Gary W. Adamson, Jul 26 2010
Starting (1, 2, 5, 11, ...) = binomial transform of [1, 1, 2, 1, 0, 0, 0, ...]. - Gary W. Adamson, Aug 25 2010
For n > 1: abs(abs(a(n+2) - a(n+1)) - abs(a(n+1) - a(n))) = n - 1; see also A086283. - Reinhard Zumkeller, Oct 17 2014
For n > 0, a(n) is the number of valid hook configurations of permutations of [n-1] that avoid the patterns 132 and 321. - Colin Defant, Apr 28 2019
For n >= 1, a(n+2) is the number of Grassmannian permutations that avoid a pattern, sigma, where sigma is a pattern of size 4 with exactly one descent. - Jessica A. Tomasko, Nov 15 2022
The number of bigrassmannian permutations in S_n is a(n+2) = binomial(n+1, 3) + 1. - Joshua Swanson, Jan 08 2024

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Kassie Archer and Aaron Geary, Descents in powers of permutations, arXiv:2406.09369 [math.CO], 2024.
Colin Defant, Motzkin intervals and valid hook configurations, arXiv preprint arXiv:1904.10451 [math.CO], 2019.
Robert DiSario, Problem 10931, Amer. Math. Monthly, 109 (No. 3, 2002), 298.
J. B. Gil and J. Tomasko, Restricted Grassmannian permutations, ECA 2:4 (2022) Article S4PP6.
Nurul Hilda Syani Putri, Mashadi, and Sri Gemawati, Sequences from heptagonal pyramid corners of integer, International Mathematical Forum, Vol. 13, 2018, no. 4, 193-200.
Luis Manuel Rivera, Integer sequences and k-commuting permutations, arXiv preprint arXiv:1406.3081 [math.CO], 2014.
Amit Kumar Singh, Akash Kumar and Thambipillai Srikanthan, Accelerating Throughput-aware Run-time Mapping for Heterogeneous MPSoCs, ACM Transactions on Design Automation of Electronic Systems, 2012. - From _N. J. A. Sloane_, Dec 25 2012
Index entries for linear recurrences with constant coefficients, signature (4,-6,4,-1).

Apart from initial terms, one more than the tetrahedral numbers A000292.

Cf. A144257, A086283.

List([0..50], n-> n*(n^2-6*n+11)/6); # G. C. Greubel, Oct 30 2019

a050407 n = n * (n ^ 2 - 6 * n + 11) `div` 6
-- Reinhard Zumkeller, Oct 17 2014

I:=[0, 1, 1, 1]; [n le 4 select I[n] else 4*Self(n-1)-6*Self(n-2)+4*Self(n-3)-Self(n-4): n in [1..50]]; // Vincenzo Librandi, Jun 22 2012

seq(binomial(n-1, 3) + 1, n = 0..46); # Zerinvary Lajos, Jul 24 2006

Table[n*(n^2-6*n+11)/6, {n,0,50}] (* Vladimir Joseph Stephan Orlovsky, Dec 17 2008 *)
LinearRecurrence[{4,-6,4,-1},{0,1,1,1},50] (* Vincenzo Librandi, Jun 22 2012 *)
Join[{0,1,1},Nest[Accumulate,Range[0,50],2]+1] (* Harvey P. Dale, Sep 23 2017 *)

a(n)=n*(n^2-6*n+11)/6 \\ Charles R Greathouse IV, Oct 07 2015

for n in range(0,50): print(n*(n**2 - 6*n + 11)/6, end=', ') # Stefano Spezia, Jan 05 2019

[n*(n^2-6*n+11)/6 for n in (0..50)] # G. C. Greubel, Oct 30 2019

From Paul Barry, Jul 21 2003: (Start)
Diagonal sums of square array A086460 (starting 1, 1, 2, ...).
a(n+2) = 1 + n*(n+1)*(n-1)/6 = Sum_{k=0..n} (0^k + (n-k)*k). (End)
a(n) = binomial(n-1,3) + binomial(n-1,0), n>=0. - Zerinvary Lajos, Jul 24 2006
G.f.: x*(1-3*x+3*x^2)/(1-x)^4. - Colin Barker, May 06 2012
a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) - a(n-4). - Vincenzo Librandi, Jun 22 2012
a(n) = A000292(n-3) + 1, n > 2. - Ivan N. Ianakiev, Apr 27 2014
E.g.f.: x*(6 - 3*x + x^2)*exp(x)/6. - G. C. Greubel, Oct 30 2019
a(n+2) = 1 + Sum_{i=3..4} binomial(n, i-1) for n >= 1. - Jessica A. Tomasko, Nov 15 2022

cp's OEIS Frontend

A008344 a(1)=0; thereafter a(n+1) = a(n) - n if a(n) >= n otherwise a(n+1) = a(n) + n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

PARI

Formula

Extensions

A050407 a(n) = n(n^2 - 6n + 11)/6.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

GAP

Haskell

Magma

Maple

Mathematica

PARI

Python

Sage

Formula

cp's OEIS Frontend

A008344 a(1)=0; thereafter a(n+1) = a(n) - n if a(n) >= n otherwise a(n+1) = a(n) + n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

PARI

Formula

Extensions

A050407 a(n) = n*(n^2 - 6*n + 11)/6.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

GAP

Haskell

Magma

Maple

Mathematica

PARI

Python

Sage

Formula

A050407 a(n) = n(n^2 - 6n + 11)/6.