login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A030619 a(n) = (# 2's)-(# 3's) in first n terms of A030604. 0
0, 1, 0, 0, 0, 1, 2, 2, 1, 0, 0, 0, 0, -1, -1, 0, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 4, 4, 4, 4, 4, 3, 4, 3, 3, 3, 4, 5, 5, 5, 5, 5, 5, 5, 4, 4, 5, 5, 5, 5, 5, 5, 5, 4, 4, 5, 6, 6, 6, 7, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 5, 5, 5, 6 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,7
LINKS
MATHEMATICA
Accumulate[Which[#==2, 1, #==3, -1, True, 0]&/@Flatten[IntegerDigits[#, 6]&/@ Fibonacci[Range[2, 30]]]] (* Harvey P. Dale, Feb 08 2015 *)
CROSSREFS
Cf. A030604.
Sequence in context: A219496 A163534 A255124 * A016370 A334577 A219494
KEYWORD
sign
AUTHOR
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 16:22 EDT 2024. Contains 371780 sequences. (Running on oeis4.)