The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A089787 a(4n-3), a(4n-2), a(4n-1), and a(4n) are the units digit of the n-th prime followed by 1, 3, 7, and 9 respectively. 3
 21, 23, 27, 29, 31, 33, 37, 39, 51, 53, 57, 59, 71, 73, 77, 79, 11, 13, 17, 19, 31, 33, 37, 39, 71, 73, 77, 79, 91, 93, 97, 99, 31, 33, 37, 39, 91, 93, 97, 99, 11, 13, 17, 19, 71, 73, 77, 79, 11, 13, 17, 19, 31, 33, 37, 39, 71, 73, 77, 79, 31, 33, 37, 39, 91, 93, 97, 99, 11 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS A modulo 10 and prime based chaotic sequence. LINKS Harvey P. Dale, Table of n, a(n) for n = 1..1000 FORMULA a(n) = 5+(-1)^n+3*cos(n*Pi/2)-3*sin(n*Pi/2)+10*(prime(floor((n+3)/4)) mod 10). - Wesley Ivan Hurt, May 06 2021 MATHEMATICA Flatten[Table[Mod[Prime[n], 10]*10+{1, 3, 7, 9}, {n, 1, 50}]] a[n_] := Mod[Prime[Floor[(n + 3)/4]], 10]*10 + {1, 3, 7, 9}[[Mod[n - 1, 4] + 1]] (* Charles R Greathouse IV, Jan 02 2013 *) Table[10*Mod[Prime[n], 10]+{1, 3, 7, 9}, {n, 30}]//Flatten (* Harvey P. Dale, Aug 24 2019 *) PROG (PARI) a(n)=prime((n+3)\4)%10*10+[9, 1, 3, 7][n%4+1] \\ Charles R Greathouse IV, Jan 02 2013 CROSSREFS Sequence in context: A095443 A095441 A095437 * A329914 A229221 A157676 Adjacent sequences:  A089784 A089785 A089786 * A089788 A089789 A089790 KEYWORD nonn,easy,less,changed AUTHOR Roger L. Bagula, Jan 09 2004 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.

Last modified May 14 10:15 EDT 2021. Contains 343880 sequences. (Running on oeis4.)