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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A227896 32-beat repeating palindromic sequence: digital roots of Fibonacci numbers indexed by the set of natural numbers not divisible by 2, 3 or 5 (A007775). 2
1, 4, 8, 8, 4, 5, 1, 5, 4, 8, 4, 5, 1, 1, 5, 8, 8, 5, 1, 1, 5, 4, 8, 4, 5, 1, 5, 4, 8, 8, 4, 1, 1, 4, 8, 8, 4, 5, 1, 5, 4, 8, 4, 5, 1, 1, 5, 8, 8, 5, 1, 1, 5, 4, 8, 4, 5, 1, 5, 4, 8, 8, 4, 1, 1, 4, 8, 8, 4, 5, 1, 5, 4, 8, 4, 5, 1, 1, 5, 8, 8, 5, 1, 1, 5, 4, 8, 4, 5, 1, 5, 4, 8, 8, 4, 1, 1, 4, 8, 8, 4, 5, 1, 5, 4, 8, 4, 5, 1, 1, 5, 8, 8, 5, 1, 1, 5, 4, 8, 4, 5, 1, 5, 4, 8, 8, 4, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..128.

Gary W. Croft, Twin Primes Demystified

Gary W. Croft, Digital Root Multiplication Matrix Produced by this Sequence

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

PROG

(PARI) a(n)=fibonacci(n\8*6 + 9 + 3*(n+1)\2*2 - max(5, (n-2)%8)*2)%9 \\ Charles R Greathouse IV, Aug 26 2014

(PARI) a(n)=[1, 4, 8, 8, 4, 5, 1, 5, 4, 8, 4, 5, 1, 1, 5, 8, 8, 5, 1, 1, 5, 4, 8, 4, 5, 1, 5, 4, 8, 8, 4, 1][n%32+1] \\ Charles R Greathouse IV, Aug 26 2014

CROSSREFS

Cf. A007775, A030132.

Sequence in context: A153258 A200395 A064927 * A114610 A200390 A137209

Adjacent sequences:  A227893 A227894 A227895 * A227897 A227898 A227899

KEYWORD

nonn,base,easy,less

AUTHOR

Gary Croft, Oct 14 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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified April 29 19:06 EDT 2017. Contains 285613 sequences.