A047522 -id:A047522 - cp's OEIS frontend

A007310 Numbers congruent to 1 or 5 mod 6.

1, 5, 7, 11, 13, 17, 19, 23, 25, 29, 31, 35, 37, 41, 43, 47, 49, 53, 55, 59, 61, 65, 67, 71, 73, 77, 79, 83, 85, 89, 91, 95, 97, 101, 103, 107, 109, 113, 115, 119, 121, 125, 127, 131, 133, 137, 139, 143, 145, 149, 151, 155, 157, 161, 163, 167, 169, 173, 175

Offset: 1

C. Christofferson (Magpie56(AT)aol.com)

Numbers n such that phi(4n) = phi(3n). - Benoit Cloitre, Aug 06 2003
Or, numbers relatively prime to 2 and 3, or coprime to 6, or having only prime factors >= 5; also known as 5-rough numbers. (Edited by M. F. Hasler, Nov 01 2014: merged with comments from Zak Seidov, Apr 26 2007 and Michael B. Porter, Oct 09 2009)
Apart from initial term(s), dimension of the space of weight 2n cuspidal newforms for Gamma_0( 38 ).
Numbers k such that k mod 2 = 1 and (k+1) mod 3 <> 1. - Klaus Brockhaus, Jun 15 2004
Also numbers n such that the sum of the squares of the first n integers is divisible by n, or A000330(n) = n*(n+1)*(2*n+1)/6 is divisible by n. - Alexander Adamchuk, Jan 04 2007
Numbers n such that the sum of squares of n consecutive integers is divisible by n, because A000330(m+n) - A000330(m) = n*(n+1)*(2*n+1)/6 + n*(m^2+n*m+m) is divisible by n independent of m. - Kaupo Palo, Dec 10 2016
A126759(a(n)) = n + 1. - Reinhard Zumkeller, Jun 16 2008
Terms of this sequence (starting from the second term) are equal to the result of the expression sqrt(4!*(k+1) + 1) - but only when this expression yields integral values (that is when the parameter k takes values, which are terms of A144065). - Alexander R. Povolotsky, Sep 09 2008
For n > 1: a(n) is prime if and only if A075743(n-2) = 1; a(2*n-1) = A016969(n-1), a(2*n) = A016921(n-1). - Reinhard Zumkeller, Oct 02 2008
A156543 is a subsequence. - Reinhard Zumkeller, Feb 10 2009
Numbers n such that ChebyshevT(x, x/2) is not an integer (is integer/2). - Artur Jasinski, Feb 13 2010
If 12*k + 1 is a perfect square (k = 0, 2, 4, 10, 14, 24, 30, 44, ... = A152749) then the square root of 12*k + 1 = a(n). - Gary Detlefs, Feb 22 2010
A089128(a(n)) = 1. Complement of A047229(n+1) for n >= 1. See A164576 for corresponding values A175485(a(n)). - Jaroslav Krizek, May 28 2010
Cf. property described by Gary Detlefs in A113801 and in Comment: more generally, these numbers are of the form (2*h*n+(h-4)*(-1)^n-h)/4 (with h, n natural numbers), therefore ((2*h*n+(h-4)*(-1)^n-h)/4)^2-1 == 0 (mod h); in this case, a(n)^2 - 1 == 0 (mod 6). Also a(n)^2 - 1 == 0 (mod 12). - Bruno Berselli, Nov 05 2010 - Nov 17 2010
Numbers n such that ( Sum_{k = 1..n} k^14 ) mod n = 0. (Conjectured) - Gary Detlefs, Dec 27 2011
From Peter Bala, May 02 2018: (Start)
The above conjecture is true. Apply Ireland and Rosen, Proposition 15.2.2. with m = 14 to obtain the congruence 6*( Sum_{k = 1..n} k^14 )/n = 7 (mod n), true for all n >= 1.  Suppose n is coprime to 6, then 6 is a unit in Z/nZ, and it follows from the congruence that ( Sum_{k = 1..n} k^14 )/n is an integer. On the other hand, if either 2 divides n or 3 divides n then the congruence shows that ( Sum_{k = 1..n} k^14 )/n cannot be integral. (End)
A126759(a(n)) = n and A126759(m) < n for m < a(n). - Reinhard Zumkeller, May 23 2013
(a(n-1)^2 - 1)/24 = A001318(n), the generalized pentagonal numbers. - Richard R. Forberg, May 30 2013
Numbers k for which A001580(k) is divisible by 3. - Bruno Berselli, Jun 18 2014
Numbers n such that sigma(n) + sigma(2n) = sigma(3n). - Jahangeer Kholdi and Farideh Firoozbakht, Aug 15 2014
a(n) are values of k such that Sum_{m = 1..k-1} m*(k-m)/k is an integer. Sums for those k are given by A062717. Also see Detlefs formula below based on A062717. - Richard R. Forberg, Feb 16 2015
a(n) are exactly those positive integers m such that the sequence b(n) = n*(n + m)*(n + 2*m)/6 is integral, and also such that the sequence c(n) = n*(n + m)*(n + 2*m)*(n + 3*m)/24 is integral. Cf. A007775. - Peter Bala, Nov 13 2015
Along with 2, these are the numbers k such that the k-th Fibonacci number is coprime to every Lucas number. - Clark Kimberling, Jun 21 2016
This sequence is the Engel expansion of 1F2(1; 5/6, 7/6; 1/36) + 1F2(1; 7/6, 11/6; 1/36)/5. - Benedict W. J. Irwin, Dec 16 2016
The sequence a(n), n >= 4 is generated by the successor of the pair of polygonal numbers {P_s(4) + 1, P_(2*s - 1)(3) + 1}, s >= 3. - Ralf Steiner, May 25 2018
The asymptotic density of this sequence is 1/3. - Amiram Eldar, Oct 18 2020
Also, the only vertices in the odd Collatz tree A088975 that are branch values to other odd nodes t == 1 (mod 2) of A005408. - Heinz Ebert, Apr 14 2021
From Flávio V. Fernandes, Aug 01 2021: (Start)
For any two terms j and k, the product j*k is also a term (the same property as p^n and smooth numbers).
From a(2) to a(phi(A033845(n))), or a((A033845(n))/3), the terms are the totatives of the A033845(n) itself. (End)
Also orders n for which cyclic and semicyclic diagonal Latin squares exist (see A123565 and A342990). - Eduard I. Vatutin, Jul 11 2023
If k is in the sequence, then k*2^m + 3 is also in the sequence, for all m > 0. - Jules Beauchamp, Aug 29 2024

			G.f. = x + 5*x^2 + 7*x^3 + 11*x^4 + 13*x^5 + 17*x^6 + 19*x^7 + 23*x^8 + ...

K. Ireland and M. Rosen, A Classical Introduction to Modern Number Theory, Springer-Verlag, 1980.

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
Andreas Enge, William Hart, and Fredrik Johansson, Short addition sequences for theta functions, arXiv:1608.06810 [math.NT], 2016-2018.
B. W. J. Irwin, Constants Whose Engel Expansions are the k-rough Numbers.
L. B. W. Jolley, Summation of Series, Dover, 1961
Cedric A. B. Smith, Prime factors and recurring duodecimals, Math. Gaz. 59 (408) (1975) 106-109.
William A. Stein's The Modular Forms Database, PARI-readable dimension tables for Gamma_0(N).
Eric Weisstein's World of Mathematics, Rough Number.
Eric Weisstein's World of Mathematics, Pi Formulas. [_Jaume Oliver Lafont_, Oct 23 2009]
Index entries for sequences related to smooth numbers [_Michael B. Porter_, Oct 09 2009]
Index entries for linear recurrences with constant coefficients, signature (1,1,-1).

A005408 \ A016945. Union of A016921 and A016969; union of A038509 and A140475. Essentially the same as A038179. Complement of A047229. Subsequence of A186422.
Cf. A000330, A001580, A002194, A019670, A032528 (partial sums), A038509 (subsequence of composites), A047209, A047336, A047522, A056020, A084967, A090771, A091998, A144065, A175885-A175887.
For k-rough numbers with other values of k, see A000027, A005408, A007775, A008364-A008366, A166061, A166063.
Cf. A126760 (a left inverse).
Row 3 of A260717 (without the initial 1).
Cf. A105397 (first differences).

Filtered([1..150],n->n mod 6=1 or n mod 6=5); # Muniru A Asiru, Dec 19 2018

a007310 n = a007310_list !! (n-1)
a007310_list = 1 : 5 : map (+ 6) a007310_list
-- Reinhard Zumkeller, Jan 07 2012

[n: n in [1..250] | n mod 6 in [1, 5]]; // Vincenzo Librandi, Feb 12 2016

seq(seq(6*i+j,j=[1,5]),i=0..100); # Robert Israel, Sep 08 2014

Select[Range[200], MemberQ[{1, 5}, Mod[#, 6]] &] (* Harvey P. Dale, Aug 27 2013 *)
a[n_] := (6 n + (-1)^n - 3)/2; a[rem156, 60] (* Robert G. Wilson v, May 26 2014 from a suggestion by N. J. A. Sloane *)
Flatten[Table[6n + {1, 5}, {n, 0, 24}]] (* Alonso del Arte, Feb 06 2016 *)
Table[2*Floor[3*n/2] - 1, {n, 1000}] (* Mikk Heidemaa, Feb 11 2016 *)

isA007310(n) = gcd(n,6)==1 \\ Michael B. Porter, Oct 09 2009

A007310(n)=n\2*6-(-1)^n \\ M. F. Hasler, Oct 31 2014

\\ given an element from the sequence, find the next term in the sequence.
nxt(n) = n + 9/2 - (n%6)/2 \\ David A. Corneth, Nov 01 2016

def A007310(n): return (n+(n>>1)<<1)-1 # Chai Wah Wu, Oct 10 2023

[i for i in range(150) if gcd(6,i) == 1] # Zerinvary Lajos, Apr 21 2009

a(n) = (6*n + (-1)^n - 3)/2. - Antonio Esposito, Jan 18 2002
a(n) = a(n-1) + a(n-2) - a(n-3), n >= 4. - Roger L. Bagula
a(n) = 3*n - 1 - (n mod 2). - Zak Seidov, Jan 18 2006
a(1) = 1 then alternatively add 4 and 2. a(1) = 1, a(n) = a(n-1) + 3 + (-1)^n. - Zak Seidov, Mar 25 2006
1 + 1/5^2 + 1/7^2 + 1/11^2 + ... = Pi^2/9 [Jolley]. - Gary W. Adamson, Dec 20 2006
For n >= 3 a(n) = a(n-2) + 6. - Zak Seidov, Apr 18 2007
From R. J. Mathar, May 23 2008: (Start)
Expand (x+x^5)/(1-x^6) = x + x^5 + x^7 + x^11 + x^13 + ...
O.g.f.: x*(1+4*x+x^2)/((1+x)*(1-x)^2). (End)
a(n) = 6*floor(n/2) - 1 + 2*(n mod 2). - Reinhard Zumkeller, Oct 02 2008
1 + 1/5 - 1/7 - 1/11 + + - - ... = Pi/3 = A019670 [Jolley eq (315)]. - Jaume Oliver Lafont, Oct 23 2009
a(n) = ( 6*A062717(n)+1 )^(1/2). - Gary Detlefs, Feb 22 2010
a(n) = 6*A000217(n-1) + 1 - 2*Sum_{i=1..n-1} a(i), with n > 1. - Bruno Berselli, Nov 05 2010
a(n) = 6*n - a(n-1) - 6 for n>1, a(1) = 1. - Vincenzo Librandi, Nov 18 2010
Sum_{n >= 1} (-1)^(n+1)/a(n) = A093766 [Jolley eq (84)]. - R. J. Mathar, Mar 24 2011
a(n) = 6*floor(n/2) + (-1)^(n+1). - Gary Detlefs, Dec 29 2011
a(n) = 3*n + ((n+1) mod 2) - 2. - Gary Detlefs, Jan 08 2012
a(n) = 2*n + 1 + 2*floor((n-2)/2) = 2*n - 1 + 2*floor(n/2), leading to the o.g.f. given by R. J. Mathar above. - Wolfdieter Lang, Jan 20 2012
1 - 1/5 + 1/7 - 1/11 + - ... = Pi*sqrt(3)/6 = A093766 (L. Euler). - Philippe Deléham, Mar 09 2013
1 - 1/5^3 + 1/7^3 - 1/11^3 + - ... = Pi^3*sqrt(3)/54 (L. Euler). - Philippe Deléham, Mar 09 2013
gcd(a(n), 6) = 1. - Reinhard Zumkeller, Nov 14 2013
a(n) = sqrt(6*n*(3*n + (-1)^n - 3)-3*(-1)^n + 5)/sqrt(2). - Alexander R. Povolotsky, May 16 2014
a(n) = 3*n + 6/(9*n mod 6 - 6). - Mikk Heidemaa, Feb 05 2016
From Mikk Heidemaa, Feb 11 2016: (Start)
a(n) = 2*floor(3*n/2) - 1.
a(n) = A047238(n+1) - 1. (suggested by Michel Marcus) (End)
E.g.f.: (2 + (6*x - 3)*exp(x) + exp(-x))/2. - Ilya Gutkovskiy, Jun 18 2016
From Bruno Berselli, Apr 27 2017: (Start)
a(k*n) = k*a(n) + (4*k + (-1)^k - 3)/2 for k>0 and odd n, a(k*n) = k*a(n) + k - 1 for even n. Some special cases:
k=2: a(2*n) = 2*a(n) + 3 for odd n, a(2*n) = 2*a(n) + 1 for even n;
k=3: a(3*n) = 3*a(n) + 4 for odd n, a(3*n) = 3*a(n) + 2 for even n;
k=4: a(4*n) = 4*a(n) + 7 for odd n, a(4*n) = 4*a(n) + 3 for even n;
k=5: a(5*n) = 5*a(n) + 8 for odd n, a(5*n) = 5*a(n) + 4 for even n, etc. (End)
From Antti Karttunen, May 20 2017: (Start)
a(A273669(n)) = 5*a(n) = A084967(n).
a((5*n)-3) = A255413(n).
A126760(a(n)) = n. (End)
a(2*m) = 6*m - 1, m >= 1; a(2*m + 1) = 6*m + 1, m >= 0. - Ralf Steiner, May 17 2018
From Amiram Eldar, Nov 22 2024: (Start)
Product_{n>=1} (1 - (-1)^n/a(n)) = sqrt(3) (A002194).
Product_{n>=2} (1 + (-1)^n/a(n)) = Pi/3 (A019670). (End)

A074377 Generalized 10-gonal numbers: m(4m - 3) for m = 0, +- 1, +- 2, +- 3, ...

Original entry on oeis.org

0, 1, 7, 10, 22, 27, 45, 52, 76, 85, 115, 126, 162, 175, 217, 232, 280, 297, 351, 370, 430, 451, 517, 540, 612, 637, 715, 742, 826, 855, 945, 976, 1072, 1105, 1207, 1242, 1350, 1387, 1501, 1540, 1660, 1701, 1827, 1870, 2002, 2047, 2185, 2232, 2376, 2425

Offset: 0

W. Neville Holmes, Sep 04 2002

Also called generalized decagonal numbers.
Odd triangular numbers decremented and halved.
It appears that this is zero together with the partial sums of A165998. - Omar E. Pol, Sep 10 2011 [this is correct, see the g.f., Joerg Arndt, Sep 29 2013]
Also, A033954 and positive members of A001107 interleaved. - Omar E. Pol, Aug 04 2012
Also, numbers m such that 16*m+9 is a square. After 1, therefore, there are no squares in this sequence. - Bruno Berselli, Jan 07 2016
Convolution of the sequences A047522 and A059841. - Ilya Gutkovskiy, Mar 16 2017
Numbers k such that the concatenation k5625 is a square. - Bruno Berselli, Nov 07 2018
Exponents in expansion of Product_{n >= 1} (1 + x^(8*n-7))*(1 + x^(8*n-1))*(1 - x^(8*n)) = 1 + x + x^7 + x^10 + x^22 + .... - Peter Bala, Dec 10 2020

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Neville Holmes, More Gemometric Integer Sequences. [Wayback Machine copy]
Index entries for linear recurrences with constant coefficients, signature (1,2,-2,-1,1).

Cf. A011848, A014493, A074378, A118277, A165998.
Cf. A001107 (10-gonal numbers).
Column 6 of A195152.
Sequences of generalized k-gonal numbers: A001318 (k=5), A000217 (k=6), A085787 (k=7), A001082 (k=8), A118277 (k=9), this sequence (k=10), A195160 (k=11), A195162 (k=12), A195313 (k=13), A195818 (k=14), A277082 (k=15), A274978 (k=16), A303305 (k=17), A274979 (k=18), A303813 (k=19), A218864 (k=20), A303298 (k=21), A303299 (k=22), A303303 (k=23), A303814 (k=24), A303304 (k=25), A316724 (k=26), A316725 (k=27), A303812 (k=28), A303815 (k=29), A316729 (k=30).
Cf. sequences of the form m*(m+k)/(k+1) listed in A274978. [Bruno Berselli, Jul 25 2016]

[n^2+n-1/4+(-1)^n/4+n*(-1)^n/2: n in [0..50]]; // Vincenzo Librandi, Sep 29 2013

CoefficientList[Series[x(1 +6x +x^2)/((1-x)(1-x^2)^2), {x, 0, 50}], x] (* Vincenzo Librandi, Sep 29 2013 *)
LinearRecurrence[{1,2,-2,-1,1}, {0,1,7,10,22}, 50] (* G. C. Greubel, Nov 07 2018 *)

PARI
```
a(n)=(2*n+3-4*(n%2))*(n-n\2)
```

concat([0],Vec(x*(1 + 6*x + x^2)/((1 - x)*(1 - x^2)^2) +O(x^50))) \\ Indranil Ghosh, Mar 16 2017

def A074377(n): return (n+1>>1)*((n<<1)+(-1 if n&1 else 3)) # Chai Wah Wu, Mar 11 2025

(n(n+1)-2)/4 where n(n+1)/2 is odd.
G.f.: x*(1+6*x+x^2)/((1-x)*(1-x^2)^2). - Michael Somos, Mar 04 2003
a(2*k) = k*(4*k+3); a(2*k+1) = (2*k+1)^2+k. - Benoit Jubin, Feb 05 2009
a(n) = n^2+n-1/4+(-1)^n/4+n*(-1)^n/2. - R. J. Mathar, Oct 08 2011
Sum_{n>=1} 1/a(n) = (4 + 3*Pi)/9. - Vaclav Kotesovec, Oct 05 2016
E.g.f.: exp(x)*x^2 + (2*exp(x) - exp(-x)/2)*x - sinh(x)/2. - Ilya Gutkovskiy, Mar 16 2017
Sum_{n>=1} (-1)^(n+1)/a(n) = 2*log(2) - 4/9. - Amiram Eldar, Feb 28 2022
a(n) = (n+1)*(2*n-1)/2 if n is odd and a(n) = n*(2*n+3)/2 if n is even. - Chai Wah Wu, Mar 11 2025

New name from T. D. Noe, Apr 21 2006

Formula in sequence name from Omar E. Pol, May 28 2012

A014176 Decimal expansion of the silver mean, 1+sqrt(2).

Original entry on oeis.org

2, 4, 1, 4, 2, 1, 3, 5, 6, 2, 3, 7, 3, 0, 9, 5, 0, 4, 8, 8, 0, 1, 6, 8, 8, 7, 2, 4, 2, 0, 9, 6, 9, 8, 0, 7, 8, 5, 6, 9, 6, 7, 1, 8, 7, 5, 3, 7, 6, 9, 4, 8, 0, 7, 3, 1, 7, 6, 6, 7, 9, 7, 3, 7, 9, 9, 0, 7, 3, 2, 4, 7, 8, 4, 6, 2, 1, 0, 7, 0, 3, 8, 8, 5, 0, 3, 8, 7, 5, 3, 4, 3, 2, 7, 6, 4, 1, 5, 7

Offset: 1

N. J. A. Sloane

From Hieronymus Fischer, Jan 02 2009: (Start)
Set c:=1+sqrt(2). Then the fractional part of c^n equals 1/c^n, if n odd. For even n, the fractional part of c^n is equal to 1-(1/c^n).
c:=1+sqrt(2) satisfies c-c^(-1)=floor(c)=2, hence c^n + (-c)^(-n) = round(c^n) for n>0, which follows from the general formula of A001622.
1/c = sqrt(2)-1.
See A001622 for a general formula concerning the fractional parts of powers of numbers x>1, which satisfy x-x^(-1)=floor(x).
Other examples of constants x satisfying the relation x-x^(-1)=floor(x) include A001622 (the golden ratio: where floor(x)=1) and A098316 (the "bronze" ratio: where floor(x)=3). (End)
In terms of continued fractions the constant c can be described by c=[2;2,2,2,...]. - Hieronymus Fischer, Oct 20 2010
Side length of smallest square containing five circles of diameter 1. - Charles R Greathouse IV, Apr 05 2011
Largest radius of four circles tangent to a circle of radius 1. - Charles R Greathouse IV, Jan 14 2013
An analog of Fermat theorem: for prime p, round(c^p) == 2 (mod p). - Vladimir Shevelev, Mar 02 2013
n*(1+sqrt(2)) is the perimeter of a 45-45-90 triangle with hypotenuse n. - Wesley Ivan Hurt, Apr 09 2016
This algebraic integer of degree 2, with minimal polynomial x^2 - 2*x - 1, is also the length ratio diagonal/side of the second largest diagonal in the regular octagon (not counting the side). The other two diagonal/side ratios are A179260 and A121601. - Wolfdieter Lang, Oct 28 2020
c^n = A001333(n) + A000129(n) * sqrt(2). - Gary W. Adamson, Apr 26 2023
c^n = c * A000129(n) + A000129(n-1), where c = 1 + sqrt(2). - Gary W. Adamson, Aug 30 2023

			2.414213562373095...

B. C. Berndt, Ramanujan's Notebooks Part II, Springer-Verlag, p. 140, Entry 25.

G. C. Greubel, Table of n, a(n) for n = 1..10000
Nicholas R. Beaton, Mireille Bousquet-Mélou, Jan de Gier, Hugo Duminil-Copin, and Anthony J. Guttmann, The critical fugacity for surface adsorption of self-avoiding walks on the honeycomb lattice is 1+sqrt(2), arXiv:1109.0358 [math-ph], 2011-2013.
Eric Weisstein's World of Mathematics, Silver Ratio
Wikipedia, Exact trigonometric constants
Wikipedia, Metallic mean
Wikipedia, Silver ratio
Index entries for algebraic numbers, degree 2

Apart from initial digit the same as A002193.
Cf. A000032, A006497, A080039, A179260, A121601.
See A098316 for [3;3,3,...]; A098317 for [4;4,4,...]; A098318 for [5;5,5,...]. - Hieronymus Fischer, Oct 20 2010
Cf. A000129, A049310.

Digits:=100: evalf(1+sqrt(2)); # Wesley Ivan Hurt, Apr 09 2016

RealDigits[1 + Sqrt@ 2, 10, 111] (* Or *)
RealDigits[Exp@ ArcSinh@ 1, 10, 111][[1]] (* Robert G. Wilson v, Aug 17 2011 *)
Circs[n_] := With[{r = Sin[Pi/n]/(1 - Sin[Pi/n])}, Graphics[Append[
  Table[Circle[(r + 1) {Sin[2 Pi k/n], Cos[2 Pi k/n]}, r], {k, n}],   {Blue, Circle[{0, 0}, 1]}]]] Circs[4] (* Charles R Greathouse IV, Jan 14 2013 *)

1+sqrt(2) \\ Charles R Greathouse IV, Jan 14 2013

Conjecture: 1+sqrt(2) = lim_{n->oo} A179807(n+1)/A179807(n).
Equals cot(Pi/8) = tan(Pi*3/8). - Bruno Berselli, Dec 13 2012, and M. F. Hasler, Jul 08 2016
Silver mean = 2 + Sum_{n>=0} (-1)^n/(P(n-1)*P(n)), where P(n) is the n-th Pell number (A000129). - Vladimir Shevelev, Feb 22 2013
Equals exp(arcsinh(1)) which is exp(A091648). - Stanislav Sykora, Nov 01 2013
Limit_{n->oo} exp(asinh(cos(Pi/n))) = sqrt(2) + 1. - Geoffrey Caveney, Apr 23 2014
exp(asinh(cos(Pi/2 - log(sqrt(2)+1)*i))) = exp(asinh(sin(log(sqrt(2)+1)*i))) = i. - Geoffrey Caveney, Apr 23 2014
Equals Product_{k>=1} A047621(k) / A047522(k) = (3/1) * (5/7) * (11/9) * (13/15) * (19/17) * (21/23) * ... . - Dimitris Valianatos, Mar 27 2019
From Wolfdieter Lang, Nov 10 2023:(Start)
Equals lim_{n->oo} A000129(n+1)/A000129(n) (see A000129, Pell).
Equals lim_{n->oo} S(n+1, 2*sqrt(2))/S(n, 2*sqrt(2)), with the Chebyshev S(n,x) polynomial (see A049310). (End)
From  Peter Bala, Mar 24 2024: (Start)
An infinite family of continued fraction expansions for this constant can be obtained from Berndt, Entry 25, by setting n = 1/2 and x = 8*k + 6 for k >= 0.
For example, taking k = 0 and k = 1 yields
sqrt(2) + 1 = 15/(6 + (1*3)/(12 + (5*7)/(12 + (9*11)/(12 + (13*15)/(12 + ... + (4*n + 1)*(4*n + 3)/(12 + ... )))))) and
sqrt(2) + 1 = (715/21) * 1/(14 + (1*3)/(28 + (5*7)/(28 + (9*11)/(28 + (13*15)/(28 + ... + (4*n + 1)*(4*n + 3)/(28 + ... )))))). (End)

A017077 a(n) = 8*n + 1.

Original entry on oeis.org

1, 9, 17, 25, 33, 41, 49, 57, 65, 73, 81, 89, 97, 105, 113, 121, 129, 137, 145, 153, 161, 169, 177, 185, 193, 201, 209, 217, 225, 233, 241, 249, 257, 265, 273, 281, 289, 297, 305, 313, 321, 329, 337, 345, 353, 361, 369, 377, 385, 393, 401, 409, 417, 425, 433

Offset: 0

N. J. A. Sloane

Cf. A007519 (primes), subsequence of A047522.
a(n-1), n >= 1, gives the first column of the triangle A238475 related to the Collatz problem. - Wolfdieter Lang, Mar 12 2014
First differences of A054552. - Wesley Ivan Hurt, Jul 08 2014
An odd number is congruent to a perfect square modulo every power of 2 iff it is in this sequence. Sketch of proof: Suppose the modulus is 2^k with k at least three and note that the only odd quadratic residue (mod 8) is 1. By application of difference of squares and the fact that gcd(x-y,x+y)=2 we can show that for odd x,y, we have x^2 and y^2 congruent mod 2^k iff x is congruent to one of y, 2^(k-1)-y, 2^(k-1)+y, 2^k-y. Now when we "lift" to (mod 2^(k+1)) we see that the degeneracy between a^2 and (2^(k-1)-a)^2 "breaks" to give a^2 and a^2-2^ka+2^(2k-2). Since a is odd, the latter is congruent to a^2+2^k (mod 2^(k+1)). Hence we can form every binary number that ends with '001' by starting modulo 8 and "lifting" while adding digits as necessary. But this sequence is exactly the set of binary numbers ending in '001', so our claim is proved. - Rafay A. Ashary, Oct 23 2016
For n > 3, also the number of (not necessarily maximal) cliques in the n-antiprism graph. - Eric W. Weisstein, Nov 29 2017
Bisection of A016813. - L. Edson Jeffery, Apr 26 2022

			Illustration of initial terms:
.                                          o       o       o
.                          o     o     o     o     o     o
.              o   o   o     o   o   o         o   o   o
.      o o o     o o o         o o o             o o o
.  o   o o o   o o o o o   o o o o o o o   o o o o o o o o o
.      o o o     o o o         o o o             o o o
.              o   o   o     o   o   o         o   o   o
.                          o     o     o     o     o     o
.                                          o       o       o
--------------------------------------------------------------
.  1       9          17              25                  33
- _Bruno Berselli_, Feb 28 2014

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Tanya Khovanova, Recursive Sequences.
Luis Manuel Rivera, Integer sequences and k-commuting permutations, arXiv preprint arXiv:1406.3081 [math.CO], 2014.
Eric Weisstein's World of Mathematics, Antiprism Graph.
Eric Weisstein's World of Mathematics, Clique.
Index entries for linear recurrences with constant coefficients, signature (2,-1).

Cf. A002189 (subsequence), A004768, A007519, A010731 (first differences), A016813, A047522, A054552.
Column 1 of A093565. Column 5 of triangle A130154. Second leftmost column of triangle A281334.
Row 1 of the arrays A081582, A238475, A371095, and A371096.
Row 2 of A257852.
Apart from the initial term, row sums of triangle A278480.

a017077 = (+ 1) . (* 8)
a017077_list = [1, 9 ..]  -- Reinhard Zumkeller, Dec 28 2012

I:=[1,9]; [n le 2 select I[n] else 2*Self(n-1)-Self(n-2): n in [1..60]]; // Vincenzo Librandi, Mar 14 2014

[8*n+1 : n in [0..50]]; // Wesley Ivan Hurt, Jul 08 2014

A017077:=n->8*n+1: seq(A017077(n), n=0..50); # Wesley Ivan Hurt, Jul 08 2014

Table[8 n + 1, {n, 0, 6!}] (* Vladimir Joseph Stephan Orlovsky, Mar 10 2010 *)
CoefficientList[Series[(1 + 7 x)/(1 - x)^2, {x, 0, 60}], x] (* Vincenzo Librandi, Mar 14 2014 *)
8 Range[0, 50] + 1 (* Wesley Ivan Hurt, Jul 08 2014 *)
LinearRecurrence[{2, -1}, {9, 17}, {0, 20}] (* Eric W. Weisstein, Nov 29 2017 *)

a(n)=8*n+1 \\ Charles R Greathouse IV, Jul 10 2016

G.f.: (1+7*x)/(1-x)^2.
a(n+1) = A004768(n). - R. J. Mathar, May 28 2008
a(n) = 2*a(n-1) - a(n-2). - Vincenzo Librandi, Mar 14 2014
E.g.f.: exp(x)*(1 + 8*x). - Stefano Spezia, May 13 2021
From Elmo R. Oliveira, Apr 10 2025: (Start)
a(n) = a(n-1) + 8 with a(0)=1.
a(n) = A016813(2*n). (End)

A047209 Numbers that are congruent to {1, 4} mod 5.

Original entry on oeis.org

1, 4, 6, 9, 11, 14, 16, 19, 21, 24, 26, 29, 31, 34, 36, 39, 41, 44, 46, 49, 51, 54, 56, 59, 61, 64, 66, 69, 71, 74, 76, 79, 81, 84, 86, 89, 91, 94, 96, 99, 101, 104, 106, 109, 111, 114, 116, 119, 121, 124, 126, 129, 131, 134, 136, 139, 141, 144, 146, 149, 151, 154

Offset: 1

N. J. A. Sloane

Apart from initial term(s), dimension of the space of weight 2n cuspidal newforms for Gamma_0( 72 ).
Cf. property described by Gary Detlefs in A113801: more generally, these numbers are of the form (2*h*n+(h-4)*(-1)^n-h)/4 (h, n natural numbers), therefore ((2*h*n + (h-4)*(-1)^n - h)/4)^2 - 1 == 0 (mod h); in our case, a(n)^2 - 1 == 0 (mod 5). - Bruno Berselli, Nov 17 2010
The sum of the alternating series (-1)^(n+1)/a(n) from n=1 to infinity is (Pi/5)*cot(Pi/5), that is (1/5)*sqrt(1 + 2/sqrt(5))*Pi. - Jean-François Alcover, May 03 2013
These numbers appear in the product of a Rogers-Ramanujan identity. See A003114 also for references. - Wolfdieter Lang, Oct 29 2016
Let m be a product of any number of terms of this sequence. Then m - 1 or m + 1 is divisible by 5. Closed under multiplication. - David A. Corneth, May 11 2018

Reinhard Zumkeller, Table of n, a(n) for n = 1..1000
William A. Stein, The modular forms database.
Eric Weisstein's World of Mathematics, Determined by Spectrum.
Index entries for linear recurrences with constant coefficients, signature (1,1,-1).

Cf. A000566, A036666, A001622, A003114, A203776, A047336, A047522, A056020, A090771, A175885, A091998, A175886, A175887, A352324.
Cf. A005408 (n=1 or 3 mod 4), A007310 (n=1 or 5 mod 6).
Cf. A045468 (primes), A032527 (partial sums).

a047209 = (flip div 2) . (subtract 2) . (* 5)
a047209_list = 1 : 4 : (map (+ 5) a047209_list)
-- Reinhard Zumkeller, Jul 19 2013, Jan 05 2011

seq(floor(5*k/2)-1, k=1..100); # Wesley Ivan Hurt, Sep 27 2013

Select[Range[0, 200], MemberQ[{1, 4}, Mod[#, 5]] &] (* Vladimir Joseph Stephan Orlovsky, Feb 12 2012 *)
LinearRecurrence[{1,1,-1},{1,4,6},70] (* Harvey P. Dale, Jul 19 2024 *)

a(n)=(10*n+(-1)^n-5)/4 \\ Charles R Greathouse IV, Sep 24 2015

G.f.: (1+3x+x^2)/((1-x)(1-x^2)).
a(n) = floor((5n-2)/2). [corrected by Reinhard Zumkeller, Jul 19 2013]
a(1) = 1, a(n) = 5(n-1) - a(n-1). - Benoit Cloitre, Apr 12 2003
From Bruno Berselli, Nov 17 2010: (Start)
a(n) = (10*n + (-1)^n - 5)/4.
a(n) - a(n-1) - a(n-2) + a(n-3) = 0 for n > 3.
a(n) = a(n-2) + 5 for n > 2.
a(n) = 5*A000217(n-1) + 1 - 2*Sum_{i=1..n-1} a(i) for n > 1.
a(n)^2 = 5*A036666(n) + 1 (cf. also Comments). (End)
a(n) = 5*floor(n/2) + (-1)^(n+1). - Gary Detlefs, Dec 29 2011
E.g.f.: 1 + ((10*x - 5)*exp(x) + exp(-x))/4. - David Lovler, Aug 23 2022
From Amiram Eldar, Nov 22 2024: (Start)
Product_{n>=1} (1 - (-1)^n/a(n)) = phi (A001622).
Product_{n>=2} (1 + (-1)^n/a(n)) = (Pi/5) * cosec(Pi/5) (A352324). (End)

Edited by Michael Somos, Sep 22 2002

A004771 a(n) = 8*n + 7. Or, numbers whose binary expansion ends in 111.

Original entry on oeis.org

7, 15, 23, 31, 39, 47, 55, 63, 71, 79, 87, 95, 103, 111, 119, 127, 135, 143, 151, 159, 167, 175, 183, 191, 199, 207, 215, 223, 231, 239, 247, 255, 263, 271, 279, 287, 295, 303, 311, 319, 327, 335, 343, 351, 359, 367, 375, 383, 391, 399, 407, 415, 423, 431

Offset: 0

N. J. A. Sloane

These numbers cannot be expressed as the sum of 3 squares. - Artur Jasinski, Nov 22 2006
These numbers cannot be perfect squares. - Cino Hilliard, Sep 03 2006
a(n-2), n >= 2, appears in the second column of triangle A239126 related to the Collatz problem. - Wolfdieter Lang, Mar 14 2014
The initial terms 7, 15, 23, 31 are the generating set for the rest of the sequence in the sense that, by Lagrange's Four Square Theorem, any number n of the form 8*k+7 can always be written as a sum of no fewer than four squares, and if n = a^2 + b^2 + c^2 + d^2, then (a mod 4)^2 + (b mod 4)^2 + (c mod 4)^2 + (d mod 4)^2 must be one of 7, 15, 23, 31. - Walter Kehowski, Jul 07 2014
Define a set of consecutive positive odd numbers {1, 3, 5, ..., 12*n + 9} and skip the number 6*n + 5. Then the contraharmonic mean of that set gives this sequence. For example, ContraharmonicMean[{1, 3, 7, 9}] = 7. - Hilko Koning, Aug 27 2018
Jacobi symbol (2, a(n)) = Kronecker symbol (a(n), 2) = 1. - Jianing Song, Aug 28 2018

James J. Tattersall, Elementary Number Theory in Nine Chapters, Cambridge University Press, 1999, page 246.

Vincenzo Librandi, Table of n, a(n) for n = 0..5000
Tanya Khovanova, Recursive Sequences
Leo Tavares, Illustration: Twin Square Frames
Leo Tavares, Illustration: Mid-line Hexagons
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 962
Index entries for linear recurrences with constant coefficients, signature (2,-1).

Cf. A004767, A008590, A017077, A017101, A017137, A033954.
Cf. A007522 (primes), subsequence of A047522.
Cf. A056753, A227144, A227146, A239126.

List([0..60],n->8*n+7); # Muniru A Asiru, Aug 28 2018

a004771 = (+ 7) . (* 8)
a004771_list = [7, 15 ..]  -- Reinhard Zumkeller, Jan 29 2013

[8*n+7: n in [0..60]]; // Vincenzo Librandi, May 28 2011

A004771:=n->8*n+7; seq(A004771(n), n=0..100); # Wesley Ivan Hurt, Dec 22 2013

8 Range[0, 60] + 7 (* or *) Range[7, 500, 8] (* or *) Table[8 n + 7, {n, 0, 60}] (* Bruno Berselli, Dec 28 2016 *)

a(n)=8*n+7 \\ Charles R Greathouse IV, Sep 23 2012

O.g.f: (7 + x)/(1 - x)^2 = 8/(1 - x)^2 - 1/(1 - x). - R. J. Mathar, Nov 30 2007
a(n) = 2*a(n-1) - a(n-2) for n >= 2.  - Vincenzo Librandi, May 28 2011
A056753(a(n)) = 7. - Reinhard Zumkeller, Aug 23 2009
a(n) = t(t(t(n))), where t(i) = 2*i + 1.
a(n) = A004767(2*n+1), for n >= 0. See also A004767(2*n) = A017101(n). - Wolfdieter Lang, Feb 03 2022
From Elmo R. Oliveira, Apr 11 2024: (Start)
E.g.f.: exp(x)*(7 + 8*x).
a(n) = A033954(n+1) - A033954(n). (End)

A001132 Primes == +-1 (mod 8).

Original entry on oeis.org

7, 17, 23, 31, 41, 47, 71, 73, 79, 89, 97, 103, 113, 127, 137, 151, 167, 191, 193, 199, 223, 233, 239, 241, 257, 263, 271, 281, 311, 313, 337, 353, 359, 367, 383, 401, 409, 431, 433, 439, 449, 457, 463, 479, 487, 503, 521, 569, 577, 593, 599

Offset: 1

N. J. A. Sloane

Primes p such that 2 is a quadratic residue mod p.
Also primes p such that p divides 2^((p-1)/2) - 1. - Cino Hilliard, Sep 04 2004
A001132 is exactly formed by the prime numbers of A118905: in fact at first every prime p of A118905 is p = u^2 - v^2 + 2uv, with for example u odd and v even so that p - 1 = 4u'(u' + 1) + 4v'(2u' + 1 - v') when u = 2u' + 1 and v = 2v'. u'(u' + 1) is even and v'(2u' + 1 - v') is always even. At second hand if p = 8k +- 1, p has the shape x^2 - 2y^2; letting u = x - y and v = y, comes p = (x - y)^2 - y^2 + 2(x - y)y = u^2 - v^2 + 2uv so p is a sum of the two legs of a Pythagorean triangle. - Richard Choulet, Dec 16 2008
These are also the primes of form x^2 - 2y^2, excluding 2. See A038873. - Tito Piezas III, Dec 28 2008
Primes p such that p^2 mod 48 = 1. - Gary Detlefs, Dec 29 2011
Primes in A047522. - Reinhard Zumkeller, Jan 07 2012
This sequence gives the odd primes p which satisfy C(p, x = 0) = +1, where C(p, x) is the minimal polynomial of 2*cos(Pi/p) (see A187360). For the proof see a comment on C(n, 0) in A230075.  - Wolfdieter Lang, Oct 24 2013
Each a(n) corresponds to precisely one primitive Pythagorean triangle. For a proof see the W. Lang link, also for a table. See also the comment by Richard Choulet above, where the case u even and v odd has not been considered. - Wolfdieter Lang, Feb 17 2015
Primes p such that p^2 mod 16 = 1. - Vincenzo Librandi, May 23 2016
Rational primes that decompose in the field Q(sqrt(2)). - N. J. A. Sloane, Dec 26 2017

Milton Abramowitz and Irene A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 870.
Ronald S. Irving, Integers, Polynomials, and Rings. New York: Springer-Verlag (2004): 274.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Ray Chandler, Table of n, a(n) for n = 1..10000 (first 1000 terms from T. D. Noe)
Milton Abramowitz and Irene A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
C. Banderier, Calcul de (2/p)
Wolfdieter Lang, A001132: Primes +1 (mod 8) or -1 (mod 8) and Sum of Legs of Primitive Pythagorean Triangles.
Index entries for related sequences
Index to sequences related to decomposition of primes in quadratic fields

For primes p such that x^m = 2 (mod p) has a solution see A001132 (for m = 2), A040028 (m = 3), A040098 (m = 4), A040159 (m = 5), A040992 (m = 6), A042966 (m = 7), A045315 (m = 8), A049596 (m = 9), A049542 (m = 10) - A049595 (m = 63). Jeff Lagarias (lagarias(AT)umich.edu) points out that all these sequences are different, although this may not be apparent from looking just at the initial terms.
Agrees with A038873 except for initial term.
Cf. A118905, A010051.
Union of A007519 and A007522.

a001132 n = a001132_list !! (n-1)
a001132_list = [x | x <- a047522_list, a010051 x == 1]
-- Reinhard Zumkeller, Jan 07 2012

[p: p in PrimesUpTo (600) | p^2 mod 16 eq 1]; // Vincenzo Librandi, May 23 2016

seq(`if`(member(ithprime(n) mod 8, {1,7}),ithprime(n),NULL),n=1..109); # Nathaniel Johnston, Jun 26 2011
for n from 1 to 600 do if (ithprime(n)^2 mod 48 = 1) then print(ithprime(n)) fi od. # Gary Detlefs, Dec 29 2011

Select[Prime[Range[250]], MemberQ[{1, 7}, Mod[#, 8]] &]  (* Harvey P. Dale, Apr 29 2011 *)
Select[Union[8Range[100] - 1, 8Range[100] + 1], PrimeQ] (* Alonso del Arte, May 22 2016 *)

select(p->p%8==1 ||p%8==7, primes(100)) \\ Charles R Greathouse IV, May 18 2015

a(n) ~ 2n log n. - Charles R Greathouse IV, May 18 2015

A058529 Numbers whose prime factors are all congruent to +1 or -1 modulo 8.

Original entry on oeis.org

1, 7, 17, 23, 31, 41, 47, 49, 71, 73, 79, 89, 97, 103, 113, 119, 127, 137, 151, 161, 167, 191, 193, 199, 217, 223, 233, 239, 241, 257, 263, 271, 281, 287, 289, 311, 313, 329, 337, 343, 353, 359, 367, 383, 391, 401, 409, 431, 433, 439, 449, 457, 463, 479, 487

Offset: 1

William Bagby (bagsbee(AT)aol.com), Dec 24 2000

Numbers of the form x^2 - 2*y^2, where x is odd and x and y are relatively prime. - Franklin T. Adams-Watters, Jun 24 2011
Consider primitive Pythagorean triangles (a^2 + b^2 = c^2, gcd(a, b) = 1, a <= b); sequence gives values b-a, sorted with duplicates removed; terms > 1 in sequence give values of a + b, sorted. (See A046086 and A046087.)
Ordered set of (semiperimeter + radius of largest inscribed circle) of all primitive Pythagorean triangles. Semiperimeter of Pythagorean triangle + radius of largest circle inscribed in triangle = ((a+b+c)/2) + ((a+b-c)/2) = a + b.
The terms of this sequence are all of the form 6*N +- 1, since the prime divisors are, and numbers of this form are closed under multiplication. In fact, all terms are == 1, 7, 17, or 23 (mod 24). - J. T. Harrison (harrison_uk_2000(AT)yahoo.co.uk), Apr 28 2009, edited by Franklin T. Adams-Watters, Jun 24 2011
Is similar to A001132, but includes composites whose factors are in A001132. Can be generated in this manner.
Third side of primitive parallepipeds with square base; that is, integer solution of a^2 + b^2 + c^2 = d^2 with gcd(a,b,c) = 1 and b = c. - Carmine Suriano, May 03 2013
Other than -1, values of difference z-y that solve the Diophantine equation x^2 + y^2 = z^2 + 2. - Carmine Suriano, Jan 05 2015
For k > 1, k is in the sequence iff A330174(k) > 0. - Ray Chandler, Feb 26 2020

B Berggren, Pytagoreiska trianglar. Tidskrift för elementär matematik, fysik och kemi, 17:129-139, 1934.
Olaf Delgado-Friedrichs and Michael O’Keeffe, Edge-transitive lattice nets, Acta Cryst. (2009). A65, 360-363.

Ray Chandler, Table of n, a(n) for n = 1..10000 (first 1000 terms from T. D. Noe)
F. Barnes, primitive Pythagorean triangles where a-b is a constant.
Johannes Boot, Draft English translation of B Berggren's (1934) article "Pytagoreiska Trianglar", ResearchGate 2017.
K. S. Brown, Pythagorean graphs.
O. Delgado-Friedrichs and M. O'Keeffe, Edge-transitive lattice nets, Acta Cryst. A, A65 (2009), 360-363.
B. Frénicle, Méthode pour trouver la solution des problèmes par les exclusions, 44 pages (see p. 31). In Divers ouvrages de mathematique .. Par Messieurs de l'Academie Royale des Sciences, in-fol, 6+518+1PP, Paris, 1693. - _Paul Curtz_, Sep 06 2008

Cf. A020882-A020886, A020888, A046086, A046087, A014498, A001132, A001653, A027748, A047522, A330174.

a058529 n = a058529_list !! (n-1)
a058529_list = filter (\x -> all (`elem` (takeWhile (<= x) a001132_list))
                                 $ a027748_row x) [1..]
-- Reinhard Zumkeller, Jan 29 2013

Select[Range[500], Union[Abs[Mod[Transpose[FactorInteger[#]][[1]], 8, -1]]] == {1} &] (* T. D. Noe, Feb 07 2012 *)

is(n)=my(f=factor(n)[,1]%8); for(i=1,#f, if(f[i]!=1 && f[i]!=7, return(0))); 1 \\ Charles R Greathouse IV, Aug 01 2016

a(n) = |A-B|=|j^2-2*k^2|, j=(2*n-1), k,n in N, GCD(j,k)=1, the absolute difference between primitive Pythagorean triple legs (sides adjacent to the right angle). - Roger M Ellingson, Dec 09 2023

More terms from Naohiro Nomoto, Jul 02 2001
Edited by Franklin T. Adams-Watters, Jun 24 2011
Duplicated comment removed and name rewritten by Wolfdieter Lang, Feb 17 2015

A074378 Even triangular numbers halved.

Original entry on oeis.org

0, 3, 5, 14, 18, 33, 39, 60, 68, 95, 105, 138, 150, 189, 203, 248, 264, 315, 333, 390, 410, 473, 495, 564, 588, 663, 689, 770, 798, 885, 915, 1008, 1040, 1139, 1173, 1278, 1314, 1425, 1463, 1580, 1620, 1743, 1785, 1914, 1958, 2093, 2139, 2280, 2328, 2475

Offset: 0

W. Neville Holmes, Sep 04 2002

Set of integers k such that k + (1 + 2 + 3 + 4 + ... + x) = 3*k, where x is sufficiently large. For example, 203 is a term because 203 + (1 + 2 + 3 + 4 + ... +28) = 609 and 609 = 3*203. - Gil Broussard, Sep 01 2008
Set of all m such that 16*m+1 is a perfect square. - Gary Detlefs, Feb 21 2010
Integers of the form Sum_{k=0..n} k/2. - Arkadiusz Wesolowski, Feb 07 2012
Numbers of the form h*(4*h + 1) for h = 0, -1, 1, -2, 2, -3, 3, ... - Bruno Berselli, Feb 26 2018
Numbers whose distance to nearest square equals their distance to nearest oblong; that is, numbers k such that A053188(k) = A053615(k). - Lamine Ngom, Oct 27 2020
The sequence terms are the exponents in the expansion of Product_{n >= 1} (1 - q^(8*n))*(1 + q^(8*n-3))*(1 + q^(8*n-5)) = 1 + q^3 + q^5 + q^14 + q^18 + .... - Peter Bala, Dec 30 2024

David A. Corneth, Table of n, a(n) for n = 0..9999
Neville Holmes, More Geometric Integer Sequences
Index entries for linear recurrences with constant coefficients, signature (1,2,-2,-1,1).

Cf. A011848, A014493, A014494, A074377, A035294, A274757.
Cf. A010709, A047522. [Vincenzo Librandi, Feb 14 2009]
Cf. A266883 (numbers n such that 16*n-15 is a square).
Cf. A016687, A153799.
Cf. A053615, A053188.

f:=func; [0] cat [f(n*m): m in [-1,1], n in [1..25]]; // Bruno Berselli, Nov 13 2012

Maple

a:=n->(2*n+1)*floor((n+1)/2): seq(a(n),n=0..50); # Muniru A Asiru, Feb 01 2019

Mathematica

1/2 * Select[PolygonalNumber@ Range[0, 100], EvenQ] (* Michael De Vlieger, Jun 01 2017, Version 10.4 *) Select[Accumulate[Range[0,100]],EvenQ]/2 (* Harvey P. Dale, Feb 15 2025 *)

PARI

a(n)=(2*n+1)*(n-n\2)

Formula

Sum_{n>=0} q^a(n) = (Prod_{n>0} (1-q^n))*(Sum_{n>=0} A035294(n)*q^n).

a(n) = n*(n + 1)/4 where n*(n + 1)/2 is even.

G.f.: x*(3 + 2*x + 3*x^2)/((1 - x)*(1 - x^2)^2).

From Benoit Jubin, Feb 05 2009: (Start)

a(n) = (2*n + 1)*floor((n + 1)/2).

a(2*k) = k*(4*k+1); a(2*k+1) = (k+1)*(4*k+3). (End)

a(2*n) = A007742(n), a(2*n-1) = A033991(n). - Arkadiusz Wesolowski, Jul 20 2012

a(n) = (4*n + 1 - (-1)^n)*(4*n + 3 - (-1)^n)/4^2. - Peter Bala, Jan 21 2019

a(n) = (2*n+1)*(n+1)*(1+(-1)^(n+1))/4 + (2*n+1)*(n)*(1+(-1)^n)/4. - Eric Simon Jacob, Jan 16 2020

From Amiram Eldar, Jul 03 2020: (Start)

Sum_{n>=1} 1/a(n) = 4 - Pi (A153799).

Sum_{n>=1} (-1)^(n+1)/a(n) = 6*log(2) - 4 (See A016687). (End)

a(n) = A014494(n)/2 = A274757(n)/3 = A266883(n) - 1. - Hugo Pfoertner, Dec 31 2024

cp's OEIS Frontend

A007310 Numbers congruent to 1 or 5 mod 6.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

GAP

Haskell

Magma

Maple

Mathematica

PARI

PARI

PARI

Python

Sage

Formula

A074377 Generalized 10-gonal numbers: m*(4*m - 3) for m = 0, +- 1, +- 2, +- 3, ...

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI

PARI

Python

Formula

Extensions

A014176 Decimal expansion of the silver mean, 1+sqrt(2).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A017077 a(n) = 8*n + 1.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Haskell

Magma

Magma

Maple

Mathematica

PARI

Formula

A047209 Numbers that are congruent to {1, 4} mod 5.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

PARI

Formula

A074377 Generalized 10-gonal numbers: m(4m - 3) for m = 0, +- 1, +- 2, +- 3, ...