The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A047542

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

A047542

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

#15 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 [0, 1, 2, 4, 7]]; // Wesley Ivan Hurt, Jul 28 2016

Discussion

Thu Sep 08

08:44

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

#14 by Harvey P. Dale at Wed Jan 27 13:20:33 EST 2021

STATUS

editing

approved

#13 by Harvey P. Dale at Wed Jan 27 13:20:30 EST 2021

MATHEMATICA

LinearRecurrence[{1, 0, 0, 0, 1, -1}, {0, 1, 2, 4, 7, 8}, 80] (* Harvey P. Dale, Jan 27 2021 *)

STATUS

approved

editing

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

STATUS

reviewed

approved

#11 by Michel Marcus at Thu Jul 28 13:00:49 EDT 2016

STATUS

proposed

reviewed

#10 by Wesley Ivan Hurt at Thu Jul 28 12:25:45 EDT 2016

STATUS

editing

proposed

#9 by Wesley Ivan Hurt at Thu Jul 28 12:25:08 EDT 2016

DATA

0, 1, 2, 4, 7, 8, 9, 10, 12, 15, 16, 17, 18, 20, 23, 24, 25, 26, 28, 31, 32, 33, 34, 36, 39, 40, 41, 42, 44, 47, 48, 49, 50, 52, 55, 56, 57, 58, 60, 63, 64, 65, 66, 68, 71, 72, 73, 74, 76, 79, 80, 81, 82, 84, 87, 88, 89, 90, 92, 95, 96, 97, 98, 100, 103, 104

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 - 50 - 7*(n mod 5) - 2*((n+1) mod 5) + 3*((n+2) mod 5) + 3*((n+3) mod 5) + 3*((n+4) mod 5))/25.

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

MAPLE

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

MATHEMATICA

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

PROG

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

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane.

STATUS

approved

editing

#8 by N. J. A. Sloane at Fri Jun 10 00:30:14 EDT 2016

STATUS

proposed

approved

#7 by Chai Wah Wu at Fri Jun 10 00:12:36 EDT 2016

STATUS

editing

proposed

#6 by Chai Wah Wu at Fri Jun 10 00:12:29 EDT 2016

FORMULA

From Chai Wah Wu, Jun 10 2016: (Start)

a(n) = a(n-1) + a(n-5) - a(n-6) for n > 6.

G.f.: x^2*(x^4 + 3*x^3 + 2*x^2 + x + 1)/(x^6 - x^5 - x + 1). (End)

STATUS

approved

editing