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.

A007310 Numbers congruent to 1 or 5 mod 6.

Original entry on oeis.org

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

Views

Author

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

Keywords

Comments

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

Examples

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

References

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

Links

Crossrefs

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).

Programs

Formula

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)

A089128 a(n) = gcd(6,n).

Original entry on oeis.org

6, 1, 2, 3, 2, 1, 6, 1, 2, 3, 2, 1, 6, 1, 2, 3, 2, 1, 6, 1, 2, 3, 2, 1, 6, 1, 2, 3, 2, 1, 6, 1, 2, 3, 2, 1, 6, 1, 2, 3, 2, 1, 6, 1, 2, 3, 2, 1, 6, 1, 2, 3, 2, 1, 6, 1, 2, 3, 2, 1, 6, 1, 2, 3, 2, 1, 6, 1, 2, 3, 2, 1, 6, 1, 2, 3, 2, 1, 6, 1, 2, 3, 2, 1, 6, 1, 2, 3, 2, 1, 6, 1, 2, 3, 2, 1, 6, 1, 2, 3, 2
Offset: 0

Views

Author

Cino Hilliard, Dec 05 2003

Keywords

Comments

Also greatest common divisor of n^2-6 and n^2+6.
The second term of sequences of this type for n=0,1,2... form the sequence 1,2,1,2,1,... in decimal 0.1212121212... = 4/33.
Multiplicative with a(p^e) = GCD(p^e, 6). - David W. Wilson, Jun 12 2005
From Jaroslav Krizek, May 27 2010: (Start)
a(n) = denominators of averages of squares of the first n positive integers for n >= 1.
a(n) is periodic sequence with period (6, 1, 2, 3, 2, 1).
See A175485 - numerators of averages of squares of the first n positive integers.
a(n) = A175485(n) * n / A000330(n).
For n = 337 holds: a(n) = 1 and simultaneously A175485(n) is square ( = 38025 = 195^2), i.e., the number k = 195 is quadratic mean (root mean square) of the first 337 positive integers. There are other such numbers - see A084231 and A084232.
Sqrt(A175485(n) / a(n)) for n >= 1 is the harmonic mean of the first n positive integers. (End)

Links

Programs

  • Haskell
    a089128 = gcd 6  -- Reinhard Zumkeller, Apr 06 2015
  • Mathematica
    GCD[Range[0,110],6] (* or *) PadRight[{},110,{6,1,2,3,2,1}] (* Harvey P. Dale, Dec 26 2018 *)
  • PARI
    g(n) = for(x=0,n,print1(gcd(x^2-6,x^2+6)","))

Formula

a(n) = 1 + [2|n] + 2*[3|n] + 2*[6|n] = (15 + 5*(-1)^n + 4*cos(n*Pi/3) + 12*cos(n*2*Pi/3))/6, where [x|y] is 1 if x divides y, 0 otherwise. - Mitch Harris Jun 15 2005
From R. J. Mathar, Apr 04 2011: (Start)
Dirichlet g.f.: zeta(s)*(1+1/2^s+2/3^s+2/6^s).
G.f.: (-6 - x - 2*x^2 - 3*x^3 - 2*x^4 - x^5) / ((x-1)*(1+x)*(1 + x + x^2)*(x^2 - x + 1)). (End)
a(n) = ((n-1) mod 2 + 1)*( 2*floor(((n-1) mod 3)/2) + 1). - Gary Detlefs, Dec 28 2011

Extensions

Name changed, using David W. Wilson's formula, by Franklin T. Adams-Watters, May 16 2018

A164576 Integer averages of the set of the first positive squares up to some n^2.

Original entry on oeis.org

1, 11, 20, 46, 63, 105, 130, 188, 221, 295, 336, 426, 475, 581, 638, 760, 825, 963, 1036, 1190, 1271, 1441, 1530, 1716, 1813, 2015, 2120, 2338, 2451, 2685, 2806, 3056, 3185, 3451, 3588, 3870, 4015, 4313, 4466, 4780, 4941, 5271, 5440, 5786, 5963, 6325, 6510
Offset: 1

Views

Author

Vladimir Joseph Stephan Orlovsky, Aug 16 2009

Keywords

Comments

Integers of the form A000330(k)/k, k listed in A007310. - R. J. Mathar, Aug 20 2009

Examples

			a(1) = 1^2/1 is an integer. The average of the first two squares is (1^2+2^2)/2=5/2, not integer.
The average of the first three squares is (1^2+2^2+3^2)/3=14/3, not integer.
The average of the first five squares is (1^2+2^2+3^2+4^2+5^2)/ 5=11, integer, and constitutes a(2).

Links

Crossrefs

Cf. A050248, A078617, A154293.

Programs

  • Mathematica
    s=0;lst={};Do[a=(s+=n^2)/n;If[Mod[a,1]==0,AppendTo[lst,a]],{n,6!}];lst
Flatten[Table[{(1 + 3 k) (1 + 4 k), (1 + k) (11 + 12 k)}, {k, 0, 499}]] (* Zak Seidov, Aug 15 2012 *)
Module[{nn=150,sq},sq=Range[nn]^2;Select[Table[Mean[Take[sq,n]],{n,nn}],IntegerQ]] (* or *) LinearRecurrence[{1,2,-2,-1,1},{1,11,20,46,63},50] (* Harvey P. Dale, Oct 31 2013 *)
  • PARI
    a(n) = 1/4*(12*n^2 - 6*n + (-1)^n*(4*n-1) + 1) \\ Colin Barker, Dec 26 2015

Formula

a(n) = A000330(A007310(n)) / A007310(n) = A175485(A007310(n)). - Jaroslav Krizek, May 28 2010
G.f. ( -x*(1+10*x+7*x^2+6*x^3) ) / ( (1+x)^2*(x-1)^3 ). - R. J. Mathar, Jan 25 2011
a(n) = 1/4*(12*n^2 - 6*n + (-1)^n*(4*n-1) + 1). - Colin Barker, Dec 26 2015

Extensions

Edited by R. J. Mathar, Aug 20 2009

A255811 Rectangular array: row n gives the numerators in the positive convolutory n-th root of (1,1,1,...).

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 5, 2, 1, 1, 1, 35, 14, 5, 1, 1, 1, 63, 35, 15, 3, 1, 1, 1, 231, 91, 195, 11, 7, 1, 1, 1, 429, 728, 663, 44, 91, 4, 1, 1, 1, 6435, 1976, 4641, 924, 1729, 20, 9, 1, 1, 1, 12155, 5434, 16575, 4004, 8645, 110, 51, 5, 1, 1, 1
Offset: 1

Views

Author

Clark Kimberling, Mar 11 2015

Keywords

Comments

The convolution n times of the sequence comprising row n is the constant sequence (1,1,1,...) = A000012.
It appears that if n+1 is a prime (A000040), then most of the terms in row n are divisible by n+1. Taking n = 4 for an example, 968 of the first 1000 terms are divisible by 5.
Is (column 4) = A175485, the numerators of averages of squares of 1,...,n?

Examples

			First, regarding the numbers numerator/denominator, we have
row 1:  1,1,1,1,1,1,1,1,1,1,1,1,1,..., the 0th self-convolution of (1,1,1,...);
row 2:  1,1/2,3/8,5/16,35/128,63/256, ..., convolutory sqrt of (1,1,1,...);
row 3:  1,1/3,2/9,14/81,35/243,91/729,..., convolutory 3rd root;
row 4:  1,1/4,5/32,15/128,195/2048,663/8192,..., convolutoary 4th root.
Taking only numerators:
row 1:  1,1,1,1,1,1,1,...
row 2:  1,1,3,5,35,63,...
row 3:  1,1,2,14,35,91,...
row 4:  1,1,5,15,195,663,...

Links

Crossrefs

Cf. A244812, A000040, A000012.

Programs

  • Mathematica
    z = 15; t[n_] := CoefficientList[Normal[Series[(1 - t)^(-1/n), {t, 0, z}]], t];
u = Table[Numerator[t[n]], {n, 1, z}]
TableForm[Table[u[[n, k]], {n, 1, z}, {k, 1, z}]]     (* A255811 array *)
Table[u[[n - k + 1, k]], {n, z}, {k, n, 1, -1}] // Flatten (* A255811 sequence *)
v = Table[Denominator[t[n]], {n, 1, z}]
TableForm[Table[v[[n, k]], {n, 1, z}, {k, 1, z}]]     (* A255812 array *)
Table[v[[n - k + 1, k]], {n, z}, {k, n, 1, -1}] // Flatten  (* A255812 sequence *)

Formula

G.f. of s: (1 - t)^(-1/n).
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.