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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A293665 a(0) = 1; a(n) = -Sum_{d|n} a(n-d). 1
1, -1, 0, -1, 0, -1, 1, -2, 0, -2, 2, -3, 1, -2, 2, -6, 2, -3, 7, -8, 2, -12, 12, -13, 0, -3, 4, -12, 17, -18, 19, -20, -19, -13, 34, -71, 54, -55, 8, -67, 73, -74, 79, -80, -72, -154, 238, -239, 39, -119, 163, -237, 97, -98, 310, -402, -22, -297, 336, -337, 271, -272, 20, -659, 369, -738 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,8

LINKS

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

Ilya Gutkovskiy, Extended graphical example

FORMULA

a(p) = -a(p-1) - 1, for p is a prime.

MATHEMATICA

a[n_] := a[n] = -Sum[a[n - d], {d, Divisors[n]}]; a[0] = 1; Table[a[n], {n, 0, 65}]

CROSSREFS

Cf. A067951, A281487, A281488.

Sequence in context: A144741 A103615 A308167 * A159632 A164733 A288311

Adjacent sequences:  A293662 A293663 A293664 * A293666 A293667 A293668

KEYWORD

sign

AUTHOR

Ilya Gutkovskiy, Oct 14 2017

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 18 17:13 EDT 2019. Contains 328186 sequences. (Running on oeis4.)