login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A057538 Birthday set of order 5: numbers congruent to +-1 modulo 2, 3, 4 and 5. 11

%I #65 Dec 11 2021 04:58:50

%S 1,11,19,29,31,41,49,59,61,71,79,89,91,101,109,119,121,131,139,149,

%T 151,161,169,179,181,191,199,209,211,221,229,239,241,251,259,269,271,

%U 281,289,299,301,311,319,329,331,341,349,359,361,371,379,389,391,401,409

%N Birthday set of order 5: numbers congruent to +-1 modulo 2, 3, 4 and 5.

%C Also numbers congruent to +-1 or +-11 modulo 30 and numbers k where (k^2 - 1)/120 is an integer; all but the first two prime legs of Pythagorean triangles which also have prime hypotenuses appear within in this sequence (A048161). - _Henry Bottomley_, Jan 31 2002

%C Numbers k such that k^2 == 1 (mod 30). - _Gary Detlefs_, Apr 16 2012

%C Subsequence of primes gives A045468. - _Ray Chandler_, Jul 29 2019

%H Michael De Vlieger, <a href="/A057538/b057538.txt">Table of n, a(n) for n = 1..10000</a>

%H A. Feist, <a href="http://www.kappamuepsilon.org/pages/a/Pentagon/Vol_60_Num_1_Fall_2000.pdf">On the Density of Birthday Sets</a>, The Pentagon, 60 (No. 1, Fall 2000), 31-35.

%H A. Feist, <a href="http://www.math.duke.edu/~andrewf/birthday.html">Maple source</a> for birthday sets. [Broken link]

%H <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,0,1,-1).

%F A093722(n) = (a(n)^2 - 1)/120.

%F G.f.: x * (1 + 10*x + 8*x^2 + 10*x^3 + x^4) / ((1 - x) * (1 - x^4)). a(-1 - n) = -a(n). - _Michael Somos_, Jan 21 2012

%F 4*a(n) = 30*(n+1) - 45 + 5*(-1)^n + 6*(-1)^floor((n+1)/2). - _R. J. Mathar_, Jul 30 2019

%e 229 is congruent to 1 (mod 2), 1 (mod 3), 1 (mod 4) and -1 (mod 5).

%e x+ 11*x^2 + 19*x^3 + 29*x^4 + 31*x^5 + 41*x^6 + 49*x^7 + 59*x^8 + 61*x^9 + ...

%p for n from 1 to 409 do if (n^2 mod 30 =1) then print(n) fi od; # _Gary Detlefs_, Apr 17 2012

%t a057538[n_] := Block[{f},

%t f[x_] :=

%t If[Mod[x, #] == 1 || Mod[x, #] == # - 1, True, False] & /@

%t Range[2, 5];

%t Select[Range[n], DeleteDuplicates[f[#]] == {True} &]]; a057538[409] (* _Michael De Vlieger_, Dec 26 2014 *)

%o (PARI) {a(n+1) = (n\4*3 + n%4)*10 + (-1)^(n\2)} /* _Michael Somos_, Oct 17 2006 */

%Y Cf. A007310, A045468, A057539, A057540, A057541, A093722.

%K easy,nonn

%O 1,2

%A Andrew R. Feist (andrewf(AT)math.duke.edu), Sep 06 2000

%E Corrected by _Henry Bottomley_, Jan 31 2002

%E Offset corrected to 1 by _Ray Chandler_, Jul 29 2019

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 05:19 EDT 2024. Contains 371782 sequences. (Running on oeis4.)