A214075 -id:A214075 - cp's OEIS frontend

A074148 a(n) = n + floor(n^2/2).

1, 4, 7, 12, 17, 24, 31, 40, 49, 60, 71, 84, 97, 112, 127, 144, 161, 180, 199, 220, 241, 264, 287, 312, 337, 364, 391, 420, 449, 480, 511, 544, 577, 612, 647, 684, 721, 760, 799, 840, 881, 924, 967, 1012, 1057, 1104, 1151, 1200, 1249, 1300, 1351, 1404, 1457

Offset: 1

Amarnath Murthy, Aug 28 2002

Last term in each group in A074147.
Index of the last occurrence of n in A100795.
Equals row sums of an infinite lower triangular matrix with alternate columns of (1, 3, 5, 7, ...) and (1, 1, 1, ...). - Gary W. Adamson, May 16 2010
a(n) = A214075(n+2,2). - Reinhard Zumkeller, Jul 03 2012
The heart pattern appears in (n+1) X (n+1) coins. Abnormal orientation heart is A065423. Normal heart is A093005 (A074148 - A065423). Void is A007590. See illustration in links. - Kival Ngaokrajang, Sep 11 2013
a(n+1) is the smallest size of an n-prolific permutation; a permutation of s letters is n-prolific if each (s - n)-subset of the letters in its one-line notation forms a unique pattern. - David Bevan, Nov 30 2016
For n > 2, a(n-1) is the smallest size of a nontrivial permuted packing of diamond tiles with diagonal length n; a permuted packing is a translational packing for which the set of translations is the plot of a permutation. - David Bevan, Nov 30 2016
Also the length of a longest path in the (n+1) X (n+1) bishop and black bishop graphs. - Eric W. Weisstein, Mar 27 2018
Row sums of A143182 triangle - Nikita Sadkov, Oct 10 2018

			Equals row sums of the generating triangle:
   1;
   3,  1;
   5,  1,  1;
   7,  1,  3,  1;
   9,  1,  5,  1,  1;
  11,  1,  7,  1,  3,  1;
  13,  1,  9,  1,  5,  1,  1;
  15,  1, 11,  1,  7,  1,  3,  1;
  ...
Example: a(5) = 17 = (9 + 1 + 5 + 1 + 1). - _Gary W. Adamson_, May 16 2010
The smallest 1-prolific permutations are 3142 and its symmetries; a(2) = 4. The smallest 2-prolific permutations are 3614725 and its symmetries; a(3) = 7. - _David Bevan_, Nov 30 2016

Vincenzo Librandi, Table of n, a(n) for n = 1..2000
D. Bevan, C. Homberger, and B. E. Tenner, Prolific permutations and permuted packings: downsets containing many large patterns, arXiv preprint arXiv:1608.06931 [math.CO], 2016.
Peter M. Chema, Illustration of initial terms, n > 1.
A. Edelman and M. La Croix, The Singular Values of the GUE (Less is More), arXiv preprint arXiv:1410.7065 [math.PR], 2014-2015. See Section 7.
Kival Ngaokrajang, Illustration of initial terms.
Eric Weisstein's World of Mathematics, Bishop Graph.
Eric Weisstein's World of Mathematics, Black Bishop Graph.
Eric Weisstein's World of Mathematics, Longest Path Problem.
Wikipedia, Cartan decomposition.
Index entries for linear recurrences with constant coefficients, signature (2,0,-2,1).

Cf. A074147, A074149, A100795, A061925.
a(n) = A000982(n+1) - 1.
Antidiagonal sums of A237447 & A237448.

List([1..60],n->n+Int(n^2/2)); # Muniru A Asiru, Jan 04 2019

[(2*n^2+4*n+(-1)^n-1)/4: n in [1..60]]; // Vincenzo Librandi, Jun 16 2011

seq(floor(n^4/(2*n^2+1)),n=2..25); # Gary Detlefs, Feb 11 2010

f[x_, y_] := Floor[Abs[y/x - x/y]]; Table[Floor[f[1, n^2 + 2 n + 1]/2], {n, 60}] (* Robert G. Wilson v, Aug 11 2010 *)
Table[n + Floor[n^2/2], {n, 20}] (* Eric W. Weisstein, Mar 27 2018 *)
Table[((-1)^n + 2 n (n + 2) - 1)/4, {n, 10}] (* Eric W. Weisstein, Mar 27 2018 *)
LinearRecurrence[{2, 0, -2, 1}, {1, 4, 7, 12}, 20] (* Eric W. Weisstein, Mar 27 2018 *)
CoefficientList[Series[(-1 - 2 x + x^2)/((-1 + x)^3 (1 + x)), {x, 0, 20}], x] (* Eric W. Weisstein, Mar 27 2018 *)

a(n)=(2*n^2+4*n-1)\/4 \\ Charles R Greathouse IV, Apr 17 2012

def A074148(n): return n + n**2//2 # Chai Wah Wu, Jun 07 2022

a(n) = (2*n^2 + 4*n + (-1)^n - 1)/4. - Vladeta Jovovic, Apr 06 2003
a(n) = A109225(n,2) for n > 1. - Reinhard Zumkeller, Jun 23 2005
a(n) = +2*a(n-1) - 2*a(n-3) + 1*a(n-4). - Joerg Arndt, Apr 02 2011
a(n) = a(n-2) + 2*n, a(0) = 0, a(1) = 1. - Paul Barry, Jul 17 2004
From R. J. Mathar, Aug 30 2008: (Start)
G.f.: x*(1 + 2*x - x^2)/((1 - x)^3*(1 + x)).
a(n) + a(n+1) = A028387(n).
a(n+1) - a(n) = A109613(n+1). (End)
a(n) = floor(n^4/(2n^2 + 1)) with offset 2..a(2) = 1. - Gary Detlefs, Feb 11 2010
a(n) = n + floor(n^2/2). - Wesley Ivan Hurt, Jun 14 2013
From Franck Maminirina Ramaharo, Jan 04 2019: (Start)
a(n) = n*(n + 1)/2 + floor(n/2) = A000217(n) + A004526(n).
E.g.f.: (exp(-x) - (1 - 6*x - 2*x^2)*exp(x))/4. (End)
Sum_{n>=1} 1/a(n) = 1 - cot(Pi/sqrt(2))*Pi/(2*sqrt(2)). - Amiram Eldar, Sep 16 2022

More terms from Vladeta Jovovic, Apr 06 2003
Edited by N. J. A. Sloane at the suggestion of Andrew S. Plewe, May 31 2007
Further edited by N. J. A. Sloane, Sep 06 2008 at the suggestion of R. J. Mathar
Description simplified by Eric W. Weisstein, Mar 27 2018

A213999 Denominators of the triangle of fractions read by rows: pf(n,0) = 1, pf(n,n) = 1/(n+1) and pf(n+1,k) = pf(n,k) + pf(n,k-1) with 0 < k < n; denominators: A213998.

Original entry on oeis.org

1, 1, 2, 1, 2, 3, 1, 2, 6, 4, 1, 2, 3, 12, 5, 1, 2, 6, 12, 60, 6, 1, 2, 3, 4, 10, 20, 7, 1, 2, 6, 12, 20, 20, 140, 8, 1, 2, 3, 12, 15, 10, 35, 280, 9, 1, 2, 6, 4, 20, 30, 70, 280, 2520, 10, 1, 2, 3, 12, 10, 12, 21, 56, 252, 2520, 11, 1, 2, 6, 12, 60, 60, 84, 168, 504, 2520, 27720, 12

Offset: 0

Reinhard Zumkeller, Jul 03 2012

T(n,0) = 1;
T(n,1) = A007395(n) for n > 0;
T(n,2) = A010704(n) for n > 1;
T(n,n-3) = A124838(n-2) for n > 2;
T(n,n-2) = A027611(n-1) for n > 1;
T(n,n-1) = A002805(n) for n > 0;
T(n,n) = n + 1;
A003418(n+1) = least common multiple of n-th row;
A214075(n,k) = floor(A213998(n,k) / T(n,k)).

			See A213998.

Reinhard Zumkeller, Rows n = 0..150 of triangle, flattened
Index entries for triangles and arrays related to Pascal's triangle

import Data.Ratio ((%), denominator, Ratio)
a213999 n k = a213999_tabl !! n !! k
a213999_row n = a213999_tabl !! n
a213999_tabl = map (map denominator) $ iterate pf [1] where
   pf row = zipWith (+) ([0] ++ row) (row ++ [-1 % (x * (x + 1))])
            where x = denominator $ last row

T[, 0] = 1; T[n, n_] := 1/(n + 1);
T[n_, k_] := T[n, k] = T[n - 1, k] + T[n - 1, k - 1];
Table[T[n, k] // Denominator, {n, 0, 11}, {k, 0, n}] // Flatten (* Jean-François Alcover, Nov 10 2021 *)

A055980 a(n) = floor(Sum_{i=1..n} 1/i).

Original entry on oeis.org

1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5

Offset: 1

Henry Bottomley, Jul 20 2000

nonn

If we choose at random (uniformly) a permutation in the symmetric group S_n then a(n) is the expected number of cycles (rounded down) in the cycle decomposition of the permutation. - Dan Fux (dan.fux(AT)OpenGaia.com or danfux(AT)OpenGaia.com), Oct 17 2001

a(n) = A214075(n,n-1) for n > 0. - Reinhard Zumkeller, Jul 03 2012

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
L. D. Kudryavtsev, Harmonic series, The Encyclopedia of Mathematics.
Eric Weisstein's World of Mathematics, High-Water Mark

Cf. A002387, A004080 (indices of records).

import Data.Ratio ((%), denominator)
a055980 = floor . sum . map (1 %) . enumFromTo 1
a055980_list = map floor $ scanl1 (+) $ map (1 %) [1..]
-- Reinhard Zumkeller, Jul 03 2012

Floor[HarmonicNumber[Range[110]]] (* Harvey P. Dale, May 22 2021 *)

a(n) ~ log(n) - Ahmed Fares (ahmedfares(AT)my-deja.com), Apr 25 2001

a(n) = floor[A001008(n)/A002805(n)]. - Lekraj Beedassy, Sep 17 2006

A022819 a(n) = floor(1/(n-1) + 2/(n-2) + 3/(n-3) + ... + (n-1)/1).

Original entry on oeis.org

0, 0, 1, 2, 4, 6, 8, 11, 13, 16, 19, 22, 25, 28, 31, 34, 38, 41, 44, 48, 51, 55, 59, 62, 66, 70, 74, 78, 81, 85, 89, 93, 97, 101, 106, 110, 114, 118, 122, 126, 131, 135, 139, 144, 148, 152, 157, 161, 166, 170, 174, 179, 183, 188, 193, 197, 202, 206, 211, 216

Offset: 0

Clark Kimberling

nonn

a(n) = A214075(n,n-2) for n > 1. - Reinhard Zumkeller, Jul 03 2012

			a(2) = floor(1/1) = 1;
a(3) = floor(1/2 + 2/1) = floor(5/2) = 2;
a(4) = floor(1/3 + 2/2 + 3/1) = floor(26/6) = 4.

Reinhard Zumkeller, Table of n, a(n) for n = 0..1000

Cf. A027612.

import Data.Ratio ((%))
a022819 n = floor $ sum $ zipWith (%) [1 .. n-1] [n-1, n-2 .. 1]
-- Reinhard Zumkeller, Jul 03 2012

s=0; Table[s+=HarmonicNumber[j]//N; Floor[s],{j,0,5!}] (* Vladimir Joseph Stephan Orlovsky, Feb 11 2010 *)
Join[{0},Floor[Accumulate[HarmonicNumber[Range[0,60]]]]] (* Harvey P. Dale, Sep 16 2019 *)

a(n) = floor(sum_{i=2..n} n/i) = floor(A000027(n)*(A001008(n)/A002805(n)-1)) = floor(A006675(n)/A000142(n)) = floor(A001705(n-1)/A000142(n-1)). - Henry Bottomley, May 05 2001

A213998 Numerators of the triangle of fractions read by rows: pf(n,0) = 1, pf(n,n) = 1/(n+1) and pf(n+1,k) = pf(n,k) + pf(n,k-1) with 0 < k < n.

Original entry on oeis.org

1, 1, 1, 1, 3, 1, 1, 5, 11, 1, 1, 7, 13, 25, 1, 1, 9, 47, 77, 137, 1, 1, 11, 37, 57, 87, 49, 1, 1, 13, 107, 319, 459, 223, 363, 1, 1, 15, 73, 533, 743, 341, 481, 761, 1, 1, 17, 191, 275, 1879, 2509, 3349, 4609, 7129, 1, 1, 19, 121, 1207, 1627, 2131, 2761, 3601, 4861, 7381, 1

Offset: 0

Reinhard Zumkeller, Jul 03 2012

T(n,0) = 1;
T(n,1) = A005408(n-1) for n > 0;
T(n,2) = A188386(n-2) for n > 2;
T(n,n-3) = A124837(n-2) for n > 2;
T(n,n-2) = A027612(n-1) for n > 1;
T(n,n-1) = A001008(n) for n > 0;
T(n,n) = 1;
A214075(n,k) = floor(T(n,k) / A213999(n,k)).

			Start of triangle pf with corresponding triangles of numerators and denominators:
. 0:                            1
. 1:                         1    1/2
. 2:                     1     3/2    1/3
. 3:                  1    5/2    11/6    1/4
. 4:              1   7/2    13/3    25/12    1/5
. 5:           1    9/2   47/6    77/12   137/60   1/6
. 6:        1  11/2   37/3    57/4    87/10    49/20    1/7
. 7:     1  13/2  107/6  319/12  459/20   223/20  363/140   1/8
. 8:  1  15/2  73/3  533/12  743/15  341/10   481/35   761/280  1/9,
.
. 0:   numerators     1                          1    denominators
. 1:                1  1                        1  2       A213999
. 2:              1   3  1                     1 2  3
. 3:            1   5  11 1                   1 2 6  4
. 4:          1  7  13  25  1                1 2 3  12 5
. 5:        1  9  47  77 137  1             1 2 6 12  60 6
. 6:      1 11  37 57  87  49  1           1 2 3 4 10  20  7
. 7:    1 13 107 319 459 223 363 1        1 2 6 12 20 20 140 8
. 8:  1 15 73 533 743 341 481 761 1,     1 2 3 12 15 10 35 280 9.

Reinhard Zumkeller, Rows n = 0..150 of triangle, flattened
Index entries for triangles and arrays related to Pascal's triangle

Cf. A005408, A188386 (columns).
Cf. A001008, A027612, A124837 (diagonals).
Cf. A213999 (denominators).

import Data.Ratio ((%), numerator, denominator, Ratio)
a213998 n k = a213998_tabl !! n !! k
a213998_row n = a213998_tabl !! n
a213998_tabl = map (map numerator) $ iterate pf [1] where
   pf row = zipWith (+) ([0] ++ row) (row ++ [-1 % (x * (x + 1))])
            where x = denominator $ last row

T[, 0] = 1; T[n, n_] := 1/(n + 1);
T[n_, k_] := T[n, k] = T[n - 1, k] + T[n - 1, k - 1];
Table[T[n, k] // Numerator, {n, 0, 10}, {k, 0, n}] // Flatten (* Jean-François Alcover, Nov 10 2021 *)

cp's OEIS Frontend

A074148 a(n) = n + floor(n^2/2).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

PARI

Python

Formula

Extensions

A213999 Denominators of the triangle of fractions read by rows: pf(n,0) = 1, pf(n,n) = 1/(n+1) and pf(n+1,k) = pf(n,k) + pf(n,k-1) with 0 < k < n; denominators: A213998.

Views

Author

Keywords

Comments

Examples

Links

Programs

Haskell

Mathematica

A055980 a(n) = floor(Sum_{i=1..n} 1/i).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell

Mathematica

Formula

A022819 a(n) = floor(1/(n-1) + 2/(n-2) + 3/(n-3) + ... + (n-1)/1).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Haskell

Mathematica

Formula

A213998 Numerators of the triangle of fractions read by rows: pf(n,0) = 1, pf(n,n) = 1/(n+1) and pf(n+1,k) = pf(n,k) + pf(n,k-1) with 0 < k < n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Haskell

Mathematica