login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A226294 Period 2: repeat [6, 4]. 3
6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

A two number repeating sequence for constructing a summation sequence from negative to positive infinity containing all primes except 2 and 5.

Essentially the same as A168428, A101432 and A010711.

NOTE: This sequence has a shift in the starting value at index 0 relative to A010711. It is used here for the purpose stated with positive and negative indices making the formula in A010711 non-applicable.

This infinitely repeating sequence, a(n), of two numbers (6,4) starting with a(0) = 6, allows for the creation of an infinite summation sequence, s(n), extending from negative to positive infinity, using the formula below in parallel with how the same is done in A226276 using a different repeating sequence. Letting "s(n+)" be the set positive s(n) values, and "s(n-)" be the absolute value of the set of negative s(n) values, the following applies:

s(n+) includes all numbers with last digits of 1 and 7.

s(n-) includes all numbers with last digits of 3 and 9.

Therefore, s(n) includes all primes (except 2 and 5) without duplication.

This is one of only two such repeating patterns that accomplish this goal relative to the primes, while excluding all numbers with a last digit of 5. The other is (8,4,4,4) but with a different split between which primes occur as positive vs. negative numbers. See A226276 for details. Both patterns have the same density of primes relative to all s(n), and both, presumably, have the same average density of primes as positive vs. negative values of s(n).

LINKS

Table of n, a(n) for n=0..86.

Index entries for linear recurrences with constant coefficients, signature (0,1).

FORMULA

a(n) = 5+(-1)^n.

To generate the summation sequence s(n), start with s(0) = 1, and a(0) = 6.

For positive values of s(n):  s(n+1) = s(n) + a(n)

For negative values of s(n):  s(n-1) = s(n) - a(n-1). n is negative here.

See example values for s(n) below, for both positive and negative indices.

G.f.: ( 6+4*x ) / ( (1-x)*(1+x) ). - R. J. Mathar, Jun 12 2013

a(n) = a(n-2) for n>1. - Wesley Ivan Hurt, Jul 18 2016

EXAMPLE

s(1) = 7, s(2) = 11, s(3) = 17, s(4) = 21, s(5) = 27, s(6) = 31;

s(-1) = -3, s(-2) = -9, s(-3) = -13, s(-4) = -19, s(-5) = -23, s(-6) = -29;

MAPLE

A226294:=n->5+(-1)^n: seq(A226294(n), n=0..100); # Wesley Ivan Hurt, Mar 24 2014

MATHEMATICA

Table[5+(-1)^n, {n, 0, 100}] (* Wesley Ivan Hurt, Mar 24 2014 *)

PROG

(PARI) a(n)=6-n%2*2 \\ Charles R Greathouse IV, Jul 17 2016

(MAGMA) &cat [[6, 4]^^50]; // Wesley Ivan Hurt, Jul 18 2016

CROSSREFS

Cf. A010711, A101432, A168428, A226276.

Sequence in context: A254307 A176394 A198235 * A176000 A065445 A216184

Adjacent sequences:  A226291 A226292 A226293 * A226295 A226296 A226297

KEYWORD

nonn,easy,less

AUTHOR

Richard R. Forberg, Jun 02 2013

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 16 02:16 EDT 2019. Contains 327088 sequences. (Running on oeis4.)