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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A105395 A simple "Fractal Jump Sequence" (FJS). 4
1, 1, 1, 7, 1, 1, 7, 1, 1, 7, 1, 1, 7, 1, 1, 7, 1, 1, 7, 1, 1, 7, 1, 1, 7, 1, 1, 7, 1, 1, 7, 1, 1, 7, 1, 1, 7, 1, 1, 7, 1, 1, 7, 1, 1, 7, 1, 1, 7, 1, 1, 7, 1, 1, 7, 1, 1, 7, 1, 1, 7, 1, 1, 7, 1, 1, 7, 1, 1, 7, 1, 1, 7, 1, 1, 7, 1, 1, 7, 1, 1, 7, 1, 1, 7, 1, 1, 7, 1, 1, 7, 1, 1, 7, 1, 1, 7, 1, 1, 7, 1, 1, 7, 1, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

COMMENTS

See A105397 for definition of Fractal Jump Sequence.

a(n+2) = the digital root of the n-th centered hexagonal number (A003215). - Colin Barker, Jan 30 2015

LINKS

Colin Barker, Table of n, a(n) for n = 1..1000

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

FORMULA

a(n) = a(n-3) for n>4. - Colin Barker, Jan 30 2015

G.f.: -x*(2*x+1)*(3*x^2-x+1) / ((x-1)*(x^2+x+1)). - Colin Barker, Jan 30 2015

PROG

(PARI) Vec(-x*(2*x+1)*(3*x^2-x+1)/((x-1)*(x^2+x+1))  + O(x^100)) \\ Colin Barker, Jan 30 2015

CROSSREFS

Cf. A003215, A105397, A003215.

Sequence in context: A086384 A102421 A019620 * A120437 A174095 A305607

Adjacent sequences:  A105392 A105393 A105394 * A105396 A105397 A105398

KEYWORD

base,easy,nonn

AUTHOR

Eric Angelini, May 01 2005

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 October 17 04:09 EDT 2019. Contains 328106 sequences. (Running on oeis4.)