The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A047603 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A047603

Numbers that are congruent to {1, 2, 3, 4, 5} mod 8.
(history; published version)

#18 by Charles R Greathouse IV at Thu Sep 08 08:44:57 EDT 2022

PROG

(MAGMAMagma) [n : n in [0..150] | n mod 8 in [1..5]]; // Wesley Ivan Hurt, Jul 28 2016

Discussion

Thu Sep 08

08:44

OEIS Server: https://oeis.org/edit/global/2944

#17 by Bruno Berselli at Mon Aug 08 03:43:31 EDT 2016

STATUS

proposed

approved

#16 by Vincenzo Librandi at Mon Aug 08 01:49:52 EDT 2016

STATUS

editing

proposed

#15 by Vincenzo Librandi at Mon Aug 08 01:49:45 EDT 2016

LINKS

Vincenzo Librandi, <a href="/A047603/b047603.txt">Table of n, a(n) for n = 1..1000</a>

MATHEMATICA

LinearRecurrence[{1, 0, 0, 0, 1, -1}, {1, 2, 3, 4, 5, 9}, 100] (* Vincenzo Librandi, Aug 08 2016 *)

STATUS

proposed

editing

#14 by Wesley Ivan Hurt at Mon Aug 08 01:43:43 EDT 2016

STATUS

editing

proposed

#13 by Wesley Ivan Hurt at Mon Aug 08 01:42:53 EDT 2016

LINKS

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

FORMULA

a(n) = n + 3*floor((n-1)/5). - Wesley Ivan Hurt, Aug 08 2016

STATUS

approved

editing

#12 by Joerg Arndt at Thu Jul 28 13:05:16 EDT 2016

STATUS

reviewed

approved

#11 by Michel Marcus at Thu Jul 28 12:57:19 EDT 2016

STATUS

proposed

reviewed

#10 by Wesley Ivan Hurt at Thu Jul 28 11:35:51 EDT 2016

STATUS

editing

proposed

#9 by Wesley Ivan Hurt at Thu Jul 28 11:35:33 EDT 2016

DATA

1, 2, 3, 4, 5, 9, 10, 11, 12, 13, 17, 18, 19, 20, 21, 25, 26, 27, 28, 29, 33, 34, 35, 36, 37, 41, 42, 43, 44, 45, 49, 50, 51, 52, 53, 57, 58, 59, 60, 61, 65, 66, 67, 68, 69, 73, 74, 75, 76, 77, 81, 82, 83, 84, 85, 89, 90, 91, 92, 93, 97, 98, 99, 100, 101

LINKS

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

FORMULA

From Wesley Ivan Hurt, Jul 28 2016: (Start)

a(n) = a(n-5) + 8 for n>5.

a(n) = (40*n - 45 + 3*(n mod 5) + 3*((n+1) mod 5) + 3*((n+2) mod 5) + 3*((n+3) mod 5) - 12*((n+4) mod 5))/25.

a(5k) = 8k-3, a(5k-1) = 8k-4, a(5k-2) = 8k-5, a(5k-3) = 8k-6, a(5k-4) = 8k-7. (End)

MAPLE

A047603:=n->8*floor(n/5)+[(1, 2, 3, 4, 5)][(n mod 5)+1]: seq(A047603(n), n=0..100); # Wesley Ivan Hurt, Jul 28 2016

MATHEMATICA

Select[Range[0, 100], MemberQ[{1, 2, 3, 4, 5}, Mod[#, 8]] &] (* Wesley Ivan Hurt, Jul 28 2016 *)

PROG

(MAGMA) [n : n in [0..150] | n mod 8 in [1..5]]; // Wesley Ivan Hurt, Jul 28 2016

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane.

STATUS

approved

editing