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.

Previous Showing 11-20 of 64 results. Next

A058377 Number of solutions to 1 +- 2 +- 3 +- ... +- n = 0.

Original entry on oeis.org

0, 0, 1, 1, 0, 0, 4, 7, 0, 0, 35, 62, 0, 0, 361, 657, 0, 0, 4110, 7636, 0, 0, 49910, 93846, 0, 0, 632602, 1199892, 0, 0, 8273610, 15796439, 0, 0, 110826888, 212681976, 0, 0, 1512776590, 2915017360, 0, 0, 20965992017, 40536016030, 0, 0, 294245741167
Offset: 1

Views

Author

Naohiro Nomoto, Dec 19 2000

Keywords

Comments

Consider the set { 1,2,3,...,n }. Sequence gives number of ways this set can be partitioned into 2 subsets with equal sums. For example, when n = 7, { 1,2,3,4,5,6,7} can be partitioned in 4 ways: {1,6,7} {2,3,4,5}; {2,5,7} {1,3,4,6}; {3,4,7} {1,2,5,6} and {1,2,4,7} {3,5,6}. - sorin (yamba_ro(AT)yahoo.com), Mar 24 2007
The "equal sums" of Sorin's comment are the positive terms of A074378 (Even triangular numbers halved). In the current sequence a(n) <> 0 iff n is the positive index (A014601) of an even triangular number (A014494). - Rick L. Shepherd, Feb 09 2010
a(n) is the number of partitions of n(n-3)/4 into distinct parts not exceeding n-1. - Alon Amit, Oct 18 2017
a(n) is the coefficient of x^(n*(n+1)/4-1) of Product_{k=2..n} (1+x^k). - Jianing Song, Nov 19 2021

Examples

			1+2-3=0, so a(3)=1;
1-2-3+4=0, so a(4)=1;
1+2-3+4-5-6+7=0, 1+2-3-4+5+6-7=0, 1-2+3+4-5+6-7=0, 1-2-3-4-5+6+7=0, so a(7)=4.

Links

Crossrefs

Cf. A000217, A014601, A014494, A025591, A063865, A063866, A063867, A069918, A074378, A111133, A161943, A348639.
Column k=2 of A275714.

Programs

  • Maple
    b:= proc(n, i) option remember; local m; m:= i*(i+1)/2;
      `if`(n>m, 0, `if`(n=m, 1, b(abs(n-i), i-1) +b(n+i, i-1)))
    end:
a:= n-> `if`(irem(n-1, 4)<2, 0, b(n, n-1)):
seq(a(n), n=1..60);  # Alois P. Heinz, Oct 30 2011
  • Mathematica
    f[n_, s_] := f[n, s] = Which[n == 0, If[s == 0, 1, 0], Abs[s] > (n*(n + 1))/2, 0, True, f[n - 1, s - n] + f[n - 1, s + n]]; Table[ f[n, 0]/2, {n, 1, 50}]
  • PARI
    list(n) = my(poly=vector(n), v=vector(n)); poly[1]=1; for(k=2, n, poly[k]=poly[k-1]*(1+'x^k)); for(k=1, n, if(k%4==1||k%4==2, v[k]=0, v[k]=polcoeff(poly[k], k*(k+1)/4-1))); v \\ Jianing Song, Nov 19 2021

Formula

a(n) is half the coefficient of q^0 in product('(q^(-k)+q^k)', 'k'=1..n) for n >= 1. - Floor van Lamoen, Oct 10 2005
a(4n+1) = a(4n+2) = 0. - Michael Somos, Apr 15 2007
a(n) = [x^n] Product_{k=1..n-1} (x^k + 1/x^k). - Ilya Gutkovskiy, Feb 01 2024

Extensions

More terms from Sascha Kurz, Mar 25 2002
Edited and extended by Robert G. Wilson v, Oct 24 2002

A036668 Hati numbers: of form 2^i*3^j*k, i+j even, (k,6)=1.

Original entry on oeis.org

1, 4, 5, 6, 7, 9, 11, 13, 16, 17, 19, 20, 23, 24, 25, 28, 29, 30, 31, 35, 36, 37, 41, 42, 43, 44, 45, 47, 49, 52, 53, 54, 55, 59, 61, 63, 64, 65, 66, 67, 68, 71, 73, 76, 77, 78, 79, 80, 81, 83, 85, 89, 91, 92, 95, 96, 97, 99, 100, 101, 102, 103, 107
Offset: 1

Views

Author

N. J. A. Sloane, Antreas P. Hatzipolakis (xpolakis(AT)hol.gr)

Keywords

Comments

If n appears then 2n and 3n do not. - Benoit Cloitre, Jun 13 2002
Closed under multiplication. Each term is a product of a unique subset of {6} U A050376 \ {2,3}. - Peter Munn, Sep 14 2019

Links

Crossrefs

Cf. A003159, A007310, A014601, A036667, A050376, A052330, A325424 (complement), A325498 (first differences), A373136 (characteristic function).
Positions of 0's in A182582.
Subsequences: A084087, A339690, A352272, A352273.
Cf. also A121537, A145204, A225837, A307150, A329575, A334747, A334748, A339746.

Programs

  • Maple
    N:= 1000: # to get all terms up to N
A:= {seq(2^i,i=0..ilog2(N))}:
Ae,Ao:= selectremove(issqr,A):
Be:= map(t -> seq(t*9^j, j=0 .. floor(log[9](N/t))),Ae):
Bo:= map(t -> seq(t*3*9^j,j=0..floor(log[9](N/(3*t)))),Ao):
B:= Be union Bo:
C1:= map(t -> seq(t*(6*i+1),i=0..floor((N/t -1)/6)),B):
C2:= map(t -> seq(t*(6*i+5),i=0..floor((N/t - 5)/6)),B):
A036668:= C1 union C2; # Robert Israel, May 09 2014
  • Mathematica
    a = {1}; Do[AppendTo[a, NestWhile[# + 1 &, Last[a] + 1,
Apply[Or, Map[MemberQ[a, #] &, Select[Flatten[{#/3, #/2}],
IntegerQ]]] &]], {150}]; a  (* A036668 *)
(* Peter J. C. Moses, Apr 23 2019 *)
  • PARI
    twos(n) = {local(r,m);r=0;m=n;while(m%2==0,m=m/2;r++);r}
threes(n) = {local(r,m);r=0;m=n;while(m%3==0,m=m/3;r++);r}
isA036668(n) = (twos(n)+threes(n))%2==0 \\ Michael B. Porter, Mar 16 2010
  • PARI
    is(n)=(valuation(n,2)+valuation(n,3))%2==0 \\ Charles R Greathouse IV, Sep 10 2015
  • PARI
    list(lim)=my(v=List(),N);for(n=0,logint(lim\=1,3),N=if(n%2,2*3^n,3^n); while(N<=lim, forstep(k=N,lim,[4*N,2*N], listput(v,k)); N<<=2)); Set(v) \\ Charles R Greathouse IV, Sep 10 2015
  • Python
    from itertools import count
def A036668(n):
    def f(x):
        c = n+x
        for i in range(x.bit_length()+1):
            i2 = 1<x:
                    break
                m = x//k
                c -= (m-1)//6+(m-5)//6+2
        return c
    m, k = n, f(n)
    while m != k: m, k = k, f(k)
    return m # Chai Wah Wu, Jan 28 2025

Formula

a(n) = 12/7 * n + O(log^2 n). - Charles R Greathouse IV, Sep 10 2015
{a(n)} = A052330({A014601(n)}), where {a(n)} denotes the set of integers in the sequence. - Peter Munn, Sep 14 2019

Extensions

Offset changed by Chai Wah Wu, Jan 28 2025

A014494 Even triangular numbers.

Original entry on oeis.org

0, 6, 10, 28, 36, 66, 78, 120, 136, 190, 210, 276, 300, 378, 406, 496, 528, 630, 666, 780, 820, 946, 990, 1128, 1176, 1326, 1378, 1540, 1596, 1770, 1830, 2016, 2080, 2278, 2346, 2556, 2628, 2850, 2926, 3160, 3240, 3486, 3570, 3828, 3916, 4186, 4278, 4560
Offset: 0

Views

Author

Mohammad K. Azarian

Keywords

Comments

Even numbers of the form n*(n+1)/2.
Even generalized hexagonal numbers. - Omar E. Pol, Apr 24 2016
The sequence terms occur as the exponents in the expansion of (1 - q^6) * Product_{n >= 1} (1 - q^(16*n-6))*(1 - q^(16*n))*(1 - q^(16*n+6)) = Sum_{n in Z} (-1)^n * q^(2*n*(4*n+1)) = 1 - q^6 - q^10 + q^28 + q^36 - q^66 - q^78 + + - - . - Peter Bala, Dec 23 2024

Links

Crossrefs

Cf. A000217, A000796, A014493, A056575, A074378, A193867.
See also similar sequences listed in A299645.

Programs

  • Magma
    [1/2*(2*n+1)*(2*n+1-(-1)^n): n in [0..50]]; // Vincenzo Librandi, Aug 18 2011
  • Mathematica
    Table[2Ceiling[n/2]*(2n + 1), {n, 0, 47}] (* Robert G. Wilson v, Nov 05 2004 *)
1/2 (2#+1)(2#+1-(-1)^#) &/@Range[0,47] (* Ant King, Nov 18 2010 *)
Select[1/2 #(#+1) &/@Range[0,95],EvenQ] (* Ant King, Nov 18 2010 *)
  • PARI
    a(n)=(2*n+1)*(2*n+1-(-1)^n)/2 \\ Charles R Greathouse IV, Oct 07 2015
  • Python
    def A014494(n): return (2*n+1)*(n+n%2) # Chai Wah Wu, Mar 11 2022

Formula

From Ant King, Nov 18 2010: (Start)
a(n) = (2*n+1)*(2*n+1-(-1)^n)/2.
a(n) = a(n-1)+2*a(n-2)-2*a(n-3)-a(n-4)+a(n-5). (End)
G.f.: -2*x*(3*x^2+2*x+3)/((x+1)^2*(x-1)^3). - Maksym Voznyy (voznyy(AT)mail.ru), Aug 10 2009
a(n) = A000217(A014601(n)). - Reinhard Zumkeller, Oct 04 2004
a(n) = A014493(n+1)-(2n+1)*(-1)^n. - R. J. Mathar, Sep 15 2009
a(n) = A193867(n+1) - 1. - Omar E. Pol, Aug 17 2011
Sum_{n>=1} 1/a(n) = 2 - Pi/2. - Robert Bilinski, Jan 20 2021
Sum_{n>=1} (-1)^(n+1)/a(n) = 3*log(2)-2. - Amiram Eldar, Mar 06 2022
E.g.f.: x*(5 + 2*x)*cosh(x) + (1 + x)*(1 + 2*x)*sinh(x). - Stefano Spezia, Dec 24 2024

Extensions

More terms from Erich Friedman

A099392 a(n) = floor((n^2 - 2*n + 3)/2).

Original entry on oeis.org

1, 1, 3, 5, 9, 13, 19, 25, 33, 41, 51, 61, 73, 85, 99, 113, 129, 145, 163, 181, 201, 221, 243, 265, 289, 313, 339, 365, 393, 421, 451, 481, 513, 545, 579, 613, 649, 685, 723, 761, 801, 841, 883, 925, 969, 1013, 1059, 1105, 1153, 1201, 1251, 1301, 1353, 1405
Offset: 1

Views

Author

Ralf Stephan following a suggestion from Luke Pebody, Oct 20 2004

Keywords

Links

Crossrefs

Differs from A085913 at n = 61. Apart from leading term, identical to A080827.
Cf. A000217, A001844, A002522, A007494, A007590, A058331 (bisections).
From Guenther Schrack, Apr 17 2018: (Start)
First differences: A052928.
Partial sums: A212964(n) + n for n > 0.
Also A058331 and A001844 interleaved. (End)
Cf. A014601, A033683, A047838, A074148, A109613, A183575, A290743.

Programs

  • Mathematica
    Array[Floor[(#^2 - 2 # + 3)/2] &, 54] (* or *)
Rest@ CoefficientList[Series[x (-1 + x - x^2 - x^3)/((1 + x) (x - 1)^3), {x, 0, 54}], x] (* Michael De Vlieger, Apr 21 2018 *)
  • PARI
    a(n)=(n^2+3)\2-n \\ Charles R Greathouse IV, Aug 01 2013

Formula

a(n) = ceiling(n^2/2)-n+1. - Paul Barry, Jul 16 2006; index shifted by R. J. Mathar, Jul 29 2007
a(n) = ceiling(A002522(n-1)/2). - Branko Curgus, Sep 02 2007
From R. J. Mathar, Feb 20 2011: (Start)
G.f.: x *( -1+x-x^2-x^3 ) / ( (1+x)*(x-1)^3 ).
a(n) = 2*a(n-1) - 2*a(n-3) + a(n-4).
a(n+1) = (3 + 2*n^2 + (-1)^n)/4. (End)
a(n) = A007590(n-1) + 1 for n >= 2. - Richard R. Forberg, Aug 01 2013
a(n) = A000217(n) - A007494(n-1). - Bui Quang Tuan, Mar 27 2015
From Guenther Schrack, Apr 17 2018: (Start)
a(n) = (2*n^2 - 4*n + 5 -(-1)^n)/4.
a(n+2) = a(n) + 2*n for n > 0.
a(n) = 2*A033683(n-1) - 1 for n > 0.
a(n) = A047838(n-1) + 2 for n > 2.
a(n) = A074148(n-1) - n + 2 for n > 1.
a(n) = A183575(n-3) + 3 for n > 3.
a(n) = 2*A290743(n-1) - 3 for n > 0.
a(n) = 2*A290743(n-2) + A109613(n-5) for n > 4.
a(n) = A074148(n) - A014601(n-1) for n > 0. (End)
Sum_{n>=1} 1/a(n) = tanh(Pi/2)*Pi/2 + coth(Pi/sqrt(2))*Pi/(2*sqrt(2)) + 1/2. - Amiram Eldar, Sep 16 2022
E.g.f.: ((2 - x + x^2)*cosh(x) + (3 - x + x^2)*sinh(x) - 2)/2. - Stefano Spezia, Jan 28 2024

A145768 a(n) = the bitwise XOR of squares of first n natural numbers.

Original entry on oeis.org

0, 1, 5, 12, 28, 5, 33, 16, 80, 1, 101, 28, 140, 37, 225, 0, 256, 33, 357, 12, 412, 37, 449, 976, 400, 993, 325, 924, 140, 965, 65, 896, 1920, 961, 1861, 908, 1692, 965, 1633, 912, 1488, 833, 1445, 668, 1292, 741, 2721, 512, 2816, 609, 2981, 396, 2844, 485
Offset: 0

Views

Author

Vladimir Reshetnikov, Oct 18 2008

Keywords

Comments

Up to n=10^8, a(15) is the only zero term and a(1)=a(9) are the only terms for which a(n)=1. Can it be proved that any number can only appear a finite number of times in this sequence? [M. F. Hasler, Oct 20 2008]
Even terms occur at A014601, odd terms at A042963; A010873(a(n))=A021913(n+1). - Reinhard Zumkeller, Jun 05 2012
If squares occur, they must be at indexes != 2 or 5 (mod 8). - Roderick MacPhee, Jul 17 2017

Links

Crossrefs

Cf. A003815, A145827, A145828, A145829, A145830, A145831. [M. F. Hasler, Oct 20 2008]
Cf. A193232.
Cf. A000290.

Programs

  • Haskell
    import Data.Bits (xor)
a145768 n = a145768_list !! n
a145768_list = scanl1 xor a000290_list  -- Reinhard Zumkeller, Jun 05 2012
  • Maple
    A[0]:= 0:
for n from 1 to 100 do A[n]:= Bits:-Xor(A[n-1],n^2) od:
seq(A[i],i=0..100); # Robert Israel, Dec 08 2019
  • Mathematica
    Rest@ FoldList[BitXor, 0, Array[#^2 &, 50]]
  • PARI
    an=0; for( i=1,50, print1(an=bitxor(an,i^2),",")) \\ M. F. Hasler, Oct 20 2008
  • PARI
    al(n)=local(m);vector(n,k,m=bitxor(m,k^2))
  • Python
    from functools import reduce
from operator import xor
def A145768(n):
    return reduce(xor, [x**2 for x in range(n+1)]) # Chai Wah Wu, Aug 08 2014

Formula

a(n)=1^2 xor 2^2 xor ... xor n^2.

A225471 Triangle read by rows, s_4(n, k) where s_m(n, k) are the Stirling-Frobenius cycle numbers of order m; n >= 0, k >= 0.

Original entry on oeis.org

1, 3, 1, 21, 10, 1, 231, 131, 21, 1, 3465, 2196, 446, 36, 1, 65835, 45189, 10670, 1130, 55, 1, 1514205, 1105182, 290599, 36660, 2395, 78, 1, 40883535, 31354119, 8951355, 1280419, 101325, 4501, 105, 1, 1267389585, 1012861224, 308846124, 48644344, 4421494, 240856, 7756, 136, 1
Offset: 0

Views

Author

Peter Luschny, May 17 2013

Keywords

Comments

The Stirling-Frobenius cycle numbers are defined in A225470.
Triangle T(n,k), read by rows, given by (3, 4, 7, 8, 11, 12, 15, 16, 19, 20, ... (A014601)) DELTA (1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, ...) where DELTA is the operator defined in A084938. - Philippe Deléham, May 14 2015

Examples

			[n\k][    0,       1,      2,     3,    4,  5,  6 ]
[0]       1,
[1]       3,       1,
[2]      21,      10,      1,
[3]     231,     131,     21,     1,
[4]    3465,    2196,    446,    36,    1,
[5]   65835,   45189,  10670,  1130,   55,  1,
[6] 1514205, 1105182, 290599, 36660, 2395, 78,  1.
...
From _Wolfdieter Lang_, Aug 11 2017: (Start)
Recurrence: T(4, 2) = T(3, 1) + (4*4 - 1)*T(3, 2) = 131 +15*21 = 446.
Boas-Buck recurrence for column k=2 and n=4: T(4, 2) = (4!/2)*(4*(3+8*(5/12)) *T(2, 2)/2! + 1*(3 + 8*(1/2))*T(3,2)/3!) = (4!/2)*(4*(19/3)/2  + 7*21/3!) =  446.
(End)

Links

Crossrefs

Columns k=0..3 give A008545, A286723(n-1), A383702, A383703.
Cf. A132393 (m=1), A028338 (m=2), A225470 (m=3).

Programs

  • Mathematica
    T[0, 0] = 1; T[n_, k_] := Sum[Binomial[n - j, k]*Abs[StirlingS1[n, n - j]]* 3^(n - k - j)*4^j, {j, 0, n - k}];
Table[T[n, k], {n, 0, 8}, {k, 0, n}] // Flatten (* Jean-François Alcover, Jul 30 2018, after Wolfdieter Lang *)
  • Sage
    @CachedFunction
def SF_C(n, k, m):
    if k > n or k < 0 : return 0
    if n == 0 and k == 0: return 1
    return SF_C(n-1, k-1, m) + (m*n-1)*SF_C(n-1, k, m)
for n in (0..8): [SF_C(n, k, 4) for k in (0..n)]

Formula

For a recurrence see the Sage program.
T(n, 0) ~ A008545; T(n, n) ~ A000012; T(n, n-1) = A014105.
Row sums ~ A047053; alternating row sums ~ A001813.
From Wolfdieter Lang, May 29 2017: (Start)
This is the Sheffer triangle (1/(1 - 4*x)^{-3/4}, -(1/4)*log(1-4*x)). See the P. Bala link where this is called exponential Riordan array, and the signed version is denoted by s_{(4,0,3)}.
E.g.f. of row polynomials in the variable x (i.e., of the triangle): (1 - 4*z)^{-(3+x)/4}.
E.g.f. of column k: (1-4*x)^(-3/4)*(-(1/4)*log(1-4*x))^k/k!, k >= 0.
Recurrence for row polynomials R(n, x) = Sum_{k=0..n} T(n, k)*x^k: R(n, x) = (x+3)*R(n-1,x+4), with R(0, x) = 1.
R(n, x) = risefac(4,3;x,n) := Product_{j=0..(n-1)} (x + (3 + 4*j)). (See the P. Bala link, eq. (16) for the signed s_{4,0,3} row polynomials.)
T(n, k) = Sum_{j=0..(n-m)} binomial(n-j, k)* S1p(n, n-j)*3^(n-k-j)*4^j, with S1p(n, m) = A132393(n, m).
T(n, k) = sigma[4,3]^{(n)}_{n-k}, with the elementary symmetric functions sigma[4,3]^{(n)}_m of degree m in the n numbers 3, 7, 11, ..., 3+4*(n-1), with sigma[4,3]^{(n)}_0 := 1. (End)
Boas-Buck type recurrence for column sequence k: T(n, k) = (n!/(n - k)) * Sum_{p=k..n-1} 4^(n-1-p)*(3 + 8*beta(n-1-p))*T(p, k)/p!, for n > k >= 0, with input T(k, k) = 1, and beta(k) = A002208(k+1)/A002209(k+1), beginning with {1/2, 5/12, 3/8, 251/720, ...}. See a comment and references in A286718. - Wolfdieter Lang, Aug 11 2017

A232096 a(n) = largest m such that m! divides 1+2+...+n; a(n) = A055881(A000217(n)).

Original entry on oeis.org

1, 1, 3, 2, 1, 1, 2, 3, 1, 1, 3, 3, 1, 1, 5, 2, 1, 1, 2, 3, 1, 1, 3, 3, 1, 1, 3, 2, 1, 1, 2, 4, 1, 1, 3, 3, 1, 1, 3, 2, 1, 1, 2, 3, 1, 1, 4, 4, 1, 1, 3, 2, 1, 1, 2, 3, 1, 1, 3, 3, 1, 1, 4, 2, 1, 1, 2, 3, 1, 1, 3, 3, 1, 1, 3, 2, 1, 1, 2, 5, 1, 1, 3, 3, 1, 1, 3
Offset: 1

Views

Author

Antti Karttunen, Nov 18 2013

Keywords

Links

Crossrefs

A042963 gives the positions of ones and A014601 the positions of larger terms.
Cf. also A232097, A076733, A232094, A232095, A232098.

Programs

Formula

a(n) = A055881(A000217(n)).
a(n) = A231719(A226061(n+1)). [Not a practical way to compute this sequence, but follows from the definitions]

A274406 Numbers m such that 9 divides m*(m + 1).

Original entry on oeis.org

0, 8, 9, 17, 18, 26, 27, 35, 36, 44, 45, 53, 54, 62, 63, 71, 72, 80, 81, 89, 90, 98, 99, 107, 108, 116, 117, 125, 126, 134, 135, 143, 144, 152, 153, 161, 162, 170, 171, 179, 180, 188, 189, 197, 198, 206, 207, 215, 216, 224, 225, 233, 234, 242, 243, 251, 252, 260, 261, 269
Offset: 1

Views

Author

Bruno Berselli, Jun 20 2016

Keywords

Comments

Equivalently, numbers congruent to 0 or 8 mod 9.
Terms of A007494 with indices in A047264. Also, terms of A060464 with indices in A047335.

Links

Crossrefs

Cf. A008591 (first bisection), A010689 (first differences), A017257 (second bisection).
Cf. similar sequences in which m*(m+1) is divisible by k: A014601 (k=4), A047208 (k=5), A007494 (k=3 and 6), A047335 (k=7), A047521 (k=8), this sequence (k=9).
Cf. A301451: numbers congruent to {1, 7} mod 9; A193910: numbers congruent to {2, 6} mod 9.

Programs

  • Magma
    [n: n in [0..300] | IsDivisibleBy(n*(n+1),9)];
  • Mathematica
    Select[Range[0, 300], Divisible[# (# + 1), 9] &]
  • PARI
    for(n=0, 300, if(n*(n+1)%9==0, print1(n", ")))
  • Sage
    [n for n in range(300) if 9.divides(n*(n+1))]

Formula

G.f.: x^2*(8 + x)/((1 + x)*(1 - x)^2).
a(n) = (18*n + 7*(-1)^n - 11)/4. Therefore: a(2*m) = 9*m-1, a(2*m+1) = 9*m. It follows that a(j)+a(k) and a(j)*a(k) belong to the sequence if j and k are not both even.
a(n) = -A090570(-n+2).
a(n) = a(n-1) + a(n-2) - a(n-3).
a(2*r+1) + a(2*r+s+1) = a(4*r+s+1) and a(2*r) + a(2*r+2*s+1) = a(4*r+2*s). A particular case provided by these identities: a(n) = a(n - 2*floor(n/6)) + a(2*floor(n/6) + 1).
E.g.f.: 1 + ((9*x - 2)*cosh(x) + 9*(x - 1)*sinh(x))/2. - Stefano Spezia, Apr 24 2021

A165717 Integers of the form k*(5+k)/4.

Original entry on oeis.org

6, 9, 21, 26, 44, 51, 75, 84, 114, 125, 161, 174, 216, 231, 279, 296, 350, 369, 429, 450, 516, 539, 611, 636, 714, 741, 825, 854, 944, 975, 1071, 1104, 1206, 1241, 1349, 1386, 1500, 1539, 1659, 1700, 1826, 1869, 2001, 2046, 2184, 2231, 2375, 2424, 2574, 2625
Offset: 1

Views

Author

Vladimir Joseph Stephan Orlovsky, Sep 24 2009

Keywords

Comments

Integers of the form k+k*(k+1)/4 = k+A000217(k)/2; for k see A014601, for A000217(k)/2 see A074378.
Are all terms composite?
Yes, because a(2*k) = k*(4*k+5) and a(2*k-1) = (k+1)*(4*k-1). - Bruno Berselli, Apr 07 2013
Numbers m such that 16*m + 25 is a square. - Vincenzo Librandi, Apr 07 2013

Examples

			For k =1,2,3,.. the value of k*(k+5)/4 is 3/2, 7/2, 6, 9, 25/2, 33/2, 21, 26, 63/2, 75/2, 44, 51,.. and the integer values define the sequence.

Links

Crossrefs

Cf. A000217, A014601, A074378.

Programs

  • Magma
    [n: n in [1..3000] | IsSquare(16*n+25)]; // Vincenzo Librandi, Apr 07 2013
  • Mathematica
    q=2;s=0;lst={};Do[s+=((n+q)/q);If[IntegerQ[s],AppendTo[lst,s]],{n,6!}];lst
Select[Table[k*(5+k)/4,{k,100}],IntegerQ] (* or *) LinearRecurrence[ {1,2,-2,-1,1},{6,9,21,26,44},60] (* Harvey P. Dale, Aug 11 2011 *)
Select[Range[1, 3000], IntegerQ[Sqrt[16 # + 25]]&] (* Vincenzo Librandi, Apr 07 2013 *)

Formula

From R. J. Mathar, Sep 25 2009: (Start)
a(n) = a(n-1) + 2*a(n-2) - 2*a(n-3) - a(n-4) + a(n-5).
G.f.: x*(-6-3*x+x^3)/( (1+x)^2 * (x-1)^3 ). (End)
Sum_{n>=1} 1/a(n) = 29/25 - Pi/5. - Amiram Eldar, Jul 26 2024

Extensions

Definition simplified by R. J. Mathar, Sep 25 2009

A176040 Periodic sequence: Repeat 3, 1.

Original entry on oeis.org

3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3
Offset: 0

Views

Author

Klaus Brockhaus, Apr 07 2010

Keywords

Comments

Interleaving of A010701 and A000012.
Also continued fraction expansion of (3+sqrt(21))/2.
Also decimal expansion of 31/99.
Essentially first differences of A014601.
Inverse binomial transform of 3 followed by A020707.
Second inverse binomial transform of A052919 without initial term 2.
Third inverse binomial transform of A007582 without initial term 1.
Exp( Sum_{n >= 1} a(n)*x^n/n ) = 1 + x + 2*x^2 + 2*x^3 + 3*x^4 + 3*x^5 + ... is the o.g.f. for A008619. - Peter Bala, Mar 13 2015

Links

Crossrefs

Cf. A153284, A010701 (all 3's sequence), A000012 (all 1's sequence), A090458 (decimal expansion of (3+sqrt(21))/2), A010684 (repeat 1, 3), A014601 (congruent to 0 or 3 mod 4), A020707 (2^(n+2)), A052919, A007582 (2^(n-1)*(1+2^n)), A008619.

Programs

  • Magma
    &cat[ [3, 1]: n in [0..52] ];
[ 2+(-1)^n: n in [0..104] ];
  • Mathematica
    PadRight[{},120,{3,1}] (* or *) LinearRecurrence[{0,1},{3,1},120] (* Harvey P. Dale, Mar 11 2015 *)

Formula

a(n) = 2+(-1)^n.
a(n) = a(n-2) for n > 1; a(0) = 3, a(1) = 1.
a(n) = -a(n-1)+4 for n > 0; a(0) = 3.
a(n) = 3*((n+1) mod 2)+(n mod 2).
a(n) = A010684(n+1).
G.f.: (3+x)/((1-x)*(1+x)).
From Amiram Eldar, Jan 01 2023: (Start)
Multiplicative with a(2^e) = 3, and a(p^e) = 1 for p >= 3.
Dirichlet g.f.: zeta(s)*(1+2^(1-s)). (End)
Previous Showing 11-20 of 64 results. Next

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

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