cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-4 of 4 results.

A008619 Positive integers repeated.

Original entry on oeis.org

1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13, 14, 14, 15, 15, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22, 23, 23, 24, 24, 25, 25, 26, 26, 27, 27, 28, 28, 29, 29, 30, 30, 31, 31, 32, 32, 33, 33, 34, 34, 35, 35, 36, 36, 37, 37, 38
Offset: 0

Views

Author

N. J. A. Sloane

Keywords

Comments

The floor of the arithmetic mean of the first n+1 positive integers. - Cino Hilliard, Sep 06 2003
Number of partitions of n into powers of 2 where no power is used more than three times, or 4th binary partition function (see A072170).
Number of partitions of n in which the greatest part is at most 2. - Robert G. Wilson v, Jan 11 2002
Number of partitions of n into at most 2 parts. - Jon Perry, Jun 16 2003
a(n) = #{k=0..n: k+n is even}. - Paul Barry, Sep 13 2003
Number of symmetric Dyck paths of semilength n+2 and having two peaks. E.g., a(6)=4 because we have UUUUUUU*DU*DDDDDDD, UUUUUU*DDUU*DDDDDD, UUUUU*DDDUUU*DDDDD and UUUU*DDDDUUUU*DDDD, where U=(1,1), D=(1,-1) and * indicates a peak. - Emeric Deutsch, Jan 12 2004
Smallest positive integer whose harmonic mean with another positive integer is n (for n > 0). For example, a(6)=4 is already given (as 4 is the smallest positive integer such that the harmonic mean of 4 (with 12) is 6) - but the harmonic mean of 2 (with -6) is also 6 and 2 < 4, so the two positive integer restrictions need to be imposed to rule out both 2 and -6.
Second outermost diagonal of Losanitsch's triangle (A034851). - Alonso del Arte, Mar 12 2006
Arithmetic mean of n-th row of A080511. - Amarnath Murthy, Mar 20 2003
a(n) is the number of ways to pay n euros (or dollars) with coins of one and two euros (respectively dollars). - Richard Choulet and Robert G. Wilson v, Dec 31 2007
Inverse binomial transform of A045623. - Philippe Deléham, Dec 30 2008
Coefficient of q^n in the expansion of (m choose 2)_q as m goes to infinity. - Y. Kelly Itakura (yitkr(AT)mta.ca), Aug 21 2002
This Itakura comment follows from a partial fraction decomposition (m choose 2)q = [(1-q^(2m-2))/(1+q) + (1-q^(2m-2))/(1-q) +2 (1-q^(m-1))^2/(1-q)^2]/4. Interpreted as generating functions in q, they have convolution structures; the first term in the numerator creates +1,-1,+1,-1 etc, the 2nd term creates +1,+1,+1,+1 etc., the 3rd term 2,4,6,8, etc. as m->infinity. - _R. J. Mathar, Sep 25 2008
Binomial transform of (-1)^n*A034008(n) = [1,0,1,-2,4,-8,16,-32,...]. - Philippe Deléham, Nov 15 2009
From Jon Perry_, Nov 16 2010: (Start)
Column sums of:
1 1 1 1 1 1...
1 1 1 1...
1 1...
..............
--------------
1 1 2 2 3 3... (End)
This sequence is also the half-convolution of the powers of 1 sequence A000012 with itself. For the definition of half-convolution see a comment on A201204, where also the rule for the o.g.f. is given. - Wolfdieter Lang, Jan 09 2012
a(n) is also the number of roots of the n-th Bernoulli polynomial in the right half-plane for n>0. - Michel Lagneau, Nov 08 2012
a(n) is the number of symmetry-allowed, linearly-independent terms at n-th order in the series expansion of the Exe vibronic perturbation matrix, H(Q) (cf. Viel & Eisfeld). - Bradley Klee, Jul 21 2015
a(n) is the number of distinct integers in the n-th row of Pascal's triangle. - Melvin Peralta, Feb 03 2016
a(n+1) for n >= 3 is the diameter of the Generalized Petersen Graph G(n, 1). - Nick Mayers, Jun 06 2016
The arithmetic function v_1(n,2) as defined in A289198. - Robert Price, Aug 22 2017
Also, this sequence is the second column in the triangle of the coefficients of the sum of two consecutive Fibonacci polynomials F(n+1, x) and F(n, x) (n>=0) in ascending powers of x. - Mohammad K. Azarian, Jul 18 2018
a(n+2) is the least k such that given any k integers, there exist two of them whose sum or difference is divisible by n. - Pablo Hueso Merino, May 09 2020
Column k = 2 of A051159. - John Keith, Jun 28 2021

References

  • D. J. Benson, Polynomial Invariants of Finite Groups, Cambridge, 1993, p. 100.
  • L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 109, Eq. [6c]; p. 116, P(n,2).
  • D. Parisse, 'The tower of Hanoi and the Stern-Brocot Array', Thesis, Munich 1997

Links

Crossrefs

Essentially same as A004526.
Harmonic mean of a(n) and A056136 is n.
Cf. A001057, A065033, A001399, A001400, A001401.
a(n)=A010766(n+2, 2).
Cf. A010551 (partial products).
Cf. A263997 (a block spiral).
Cf. A289187.
Column 2 of A235791.

Programs

  • Haskell
    a008619 = (+ 1) . (`div` 2)
a008619_list = concatMap (\x -> [x,x]) [1..]
-- Reinhard Zumkeller, Apr 02 2012
  • Magma
    I:=[1,1,2]; [n le 3 select I[n] else Self(n-1)+Self(n-2)-Self(n-3): n in [1..100]]; // Vincenzo Librandi, Feb 04 2015
  • Maple
    a:= n-> iquo(n+2, 2): seq(a(n), n=0..75);
  • Mathematica
    Flatten[Table[{n,n},{n,35}]] (* Harvey P. Dale, Sep 20 2011 *)
With[{c=Range[40]},Riffle[c,c]] (* Harvey P. Dale, Feb 23 2013 *)
CoefficientList[Series[1/(1 - x - x^2 + x^3), {x, 0, 75}], x] (* Robert G. Wilson v, Feb 05 2015 *)
LinearRecurrence[{1, 1, -1}, {1, 1, 2}, 75] (* Robert G. Wilson v, Feb 05 2015 *)
Table[QBinomial[n, 2, -1], {n, 2, 75}] (* John Keith, Jun 28 2021 *)
  • PARI
    a(n)=n\2+1
  • Python
    def A008619(n): return (n>>1)+1 # Chai Wah Wu, Jul 07 2022
  • Sage
    a = lambda n: 1 if n==0 else a(n-1)+1 if 2.divides(n) else a(n-1) # Peter Luschny, Feb 05 2015
  • Scala
    (2 to 99).map( / 2) // _Alonso del Arte, May 09 2020

Formula

Euler transform of [1, 1].
a(n) = 1 + floor(n/2).
G.f.: 1/((1-x)(1-x^2)).
E.g.f.: ((3+2*x)*exp(x) + exp(-x))/4.
a(n) = a(n-1) + a(n-2) - a(n-3) = -a(-3-n).
a(0) = a(1) = 1 and a(n) = floor( (a(n-1) + a(n-2))/2 + 1 ).
a(n) = (2*n + 3 + (-1)^n)/4. - Paul Barry, May 27 2003
a(n) = Sum_{k=0..n} Sum_{j=0..k} Sum_{i=0..j} binomial(j, i)*(-2)^i. - Paul Barry, Aug 26 2003
E.g.f.: ((1+x)*exp(x) + cosh(x))/2. - Paul Barry, Sep 13 2003
a(n) = A108299(n-1,n)*(-1)^floor(n/2) for n > 0. - Reinhard Zumkeller, Jun 01 2005
a(n) = A108561(n+2,n) for n > 0. - Reinhard Zumkeller, Jun 10 2005
a(n) = A125291(A125293(n)) for n>0. - Reinhard Zumkeller, Nov 26 2006
a(n) = ceiling(n/2), n >= 1. - Mohammad K. Azarian, May 22 2007
INVERT transformation yields A006054 without leading zeros. INVERTi transformation yields negative of A124745 with the first 5 terms there dropped. - R. J. Mathar, Sep 11 2008
a(n) = A026820(n,2) for n > 1. - Reinhard Zumkeller, Jan 21 2010
a(n) = n - a(n-1) + 1 (with a(0)=1). - Vincenzo Librandi, Nov 19 2010
a(n) = A000217(n) / A110654(n). - Reinhard Zumkeller, Aug 24 2011
a(n+1) = A181971(n,n). - Reinhard Zumkeller, Jul 09 2012
1/(1+2/(2+3/(3+4/(4+5/(5+...(continued fraction))))) = 1/(e-1), see A073333. - Philippe Deléham, Mar 09 2013
a(n) = floor(A000217(n)/n), n > 0. - L. Edson Jeffery, Jul 26 2013
a(n) = n*a(n-1) mod (n+1) = -a(n-1) mod (n+1), the least positive residue modulo n+1 for each expression for n > 0, with a(0) = 1 (basically restatements of Vincenzo Librandi's formula). - Rick L. Shepherd, Apr 02 2014
a(n) = (a(0) + a(1) + ... + a(n-1))/a(n-1), where a(0) = 1. - Melvin Peralta, Jun 16 2015
a(n) = Sum_{k=0..n} (-1)^(n-k) * (k+1). - Rick L. Shepherd, Sep 18 2020
a(n) = a(n-2) + 1 for n >= 2. - Vladimír Modrák, Sep 29 2020
a(n) = A004526(n)+1. - Chai Wah Wu, Jul 07 2022

Extensions

Additional remarks from Daniele Parisse
Edited by N. J. A. Sloane, Sep 06 2009
Partially edited by Joerg Arndt, Mar 11 2010

A080512 a(n) = n if n is odd, a(n) = 3*n/2 if n is even.

Original entry on oeis.org

1, 3, 3, 6, 5, 9, 7, 12, 9, 15, 11, 18, 13, 21, 15, 24, 17, 27, 19, 30, 21, 33, 23, 36, 25, 39, 27, 42, 29, 45, 31, 48, 33, 51, 35, 54, 37, 57, 39, 60, 41, 63, 43, 66, 45, 69, 47, 72, 49, 75, 51, 78, 53, 81, 55, 84, 57, 87, 59, 90, 61, 93, 63, 96, 65, 99, 67, 102
Offset: 1

Views

Author

Amarnath Murthy, Mar 20 2003

Keywords

Comments

First differences of the generalized heptagonal numbers A085787. - Omar E. Pol, Sep 10 2011
Last term in n-th row of A080511.
Also A005408 and positive terms of A008585 interleaved. - Omar E. Pol, May 28 2012
a(n) is also the length of the n-th line segment of the rectangular spiral whose vertices are the generalized heptagonal numbers. - Omar E. Pol, Jul 27 2018

Links

Crossrefs

Cf. A080511, A008619, A126988.
Cf. A005408, A008585, A064455, A085787, A126246

Programs

  • Haskell
    import Data.List (transpose)
a080512 n = if m == 0 then 3 * n' else n  where (n', m) = divMod n 2
a080512_list = concat $ transpose [[1, 3 ..], [3, 6 ..]]
-- Reinhard Zumkeller, Apr 06 2015
  • Magma
    [n*(5+(-1)^n)/4: n in [1..60]]; // Vincenzo Librandi, Sep 11 2011
  • Mathematica
    Table[If[EvenQ[n],3n/2,n],{n,68}] (* Jayanta Basu, May 20 2013 *)

Formula

a(n) = n if n is odd, a(n) = 3*n/2 if n is even.
a(n)*a(n+3) = -3 + a(n+1)*a(n+2).
From Paul Barry, Sep 04 2003: (Start)
G.f.: (1+3*x+x^2)/((1-x^2)^2);
a(n) = n*(5 + (-1)^n)/4. (End)
Multiplicative with a(2^e) = 3*2^(e-1), a(p^e) = p^e otherwise. - Christian G. Bower, May 17 2005
Equals A126988 * (1, 1, 0, 0, 0, ...) - Gary W. Adamson, Apr 17 2007
Dirichlet g.f.: zeta(s-1) * (1 + 1/2^s). - Amiram Eldar, Oct 25 2023
Sum_{d divides n} mu(n/d)*a(d) = A126246(n), where mu(n) = A008683(n) is the Möbius function. - Peter Bala, Dec 31 2023

A080504 Triangle whose n-th row contains the least set (ordered lexicographically) of n distinct positive integers whose arithmetic and geometric means are both integers.

Original entry on oeis.org

1, 1, 9, 1, 2, 108, 1, 2, 5, 1000, 1, 2, 3, 4, 1012500, 1, 2, 3, 4, 8, 15552, 1, 2, 3, 4, 5, 6, 25015118625000, 1, 2, 3, 4, 5, 6, 11, 17757684573750000, 1, 2, 3, 4, 5, 6, 7, 8, 19699405917187500, 1, 2, 3, 4, 5, 6, 7, 8, 14, 295491088757812500, 1, 2, 3, 4, 5, 6, 7
Offset: 1

Views

Author

Amarnath Murthy, Mar 20 2003

Keywords

Comments

Row n has the form {1,2,...,n-2,x,y} where n-1 <= x < y. x is minimal such that y exists.

Examples

			The fourth row contains 1,2,5,1000, with AM=252 and GM=10. There is no set of the form {1,2,3,y} or {1,2,4,y} whose AM and GM are both integers.

Crossrefs

Cf. A080505, A081556, A080506, A080507, A080508, A080511.

A080508 Triangle whose n-th row contains the least set (ordered lexicographically) of n distinct positive integers whose geometric mean is an integer.

Original entry on oeis.org

1, 1, 4, 1, 2, 4, 1, 2, 3, 216, 1, 2, 3, 4, 324, 1, 2, 3, 4, 5, 6075000, 1, 2, 3, 4, 5, 6, 30375000, 1, 2, 3, 4, 5, 6, 7, 750453558750000, 1, 2, 3, 4, 5, 6, 7, 8, 19699405917187500, 1, 2, 3, 4, 5, 6, 7, 8, 9, 459652804734375000, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 9652708899421875000
Offset: 1

Views

Author

Amarnath Murthy, Mar 20 2003

Keywords

Comments

The n-th row has the form {1,2,...,n-1,x}, where x is as small as possible.

Examples

			Triangle begins:
  1;
  1, 4;
  1, 2, 4;
  1, 2, 3, 216;
  1, 2, 3,   4, 324;
  1, 2, 3,   4,   5, 6075000;
  ...

Links

Crossrefs

Cf. A080509, A080510, A080504, A080511.

Programs

  • Maple
    f:= proc(n) local F;
  F:= ifactors((n-1)!)[2];
  mul(t[1]^(n-(t[2] mod n)),t=F)
end proc:
f(2):= 4:
seq(op([seq(j,j=1..i-1),f(i)]),i=1..20); # Robert Israel, Nov 04 2018
  • Mathematica
    MapAt[{First@ #, 4 Last@ #} &, Array[Append[Range[# - 1], Apply[Times, Prime@ Range@ PrimePi[# - 1]]^#/(# - 1)!] &, 11], 2] // Flatten (* Michael De Vlieger, Nov 05 2018 *)

Extensions

More terms using A080509 from Michel Marcus, Nov 04 2018
Showing 1-4 of 4 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.