Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A083238
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A083238 First order recursion: a[0]=1; a(n)=sigma[1,n]-a(n-1). +0
3
0, 3, 1, 6, 0, 12, -4, 19, -6, 24, -12, 40, -26, 50, -26, 57, -39, 78, -58, 100, -68, 104, -80, 140, -109, 151, -111, 167, -137, 209, -177, 240, -192, 246, -198, 289, -251, 311, -255, 345, -303, 399, -355, 439, -361, 433, -385, 509, -452, 545, -473, 571, -517, 637, -565, 685, -605, 695, -635, 803, -741, 837, -733, 860 (list; graph; listen)
OFFSET

1,2

COMMENT

Provide interesting decomposition: sigma(n)=u+w, where u and w consecutive terms of this sequence; this depends also on initial value.

EXAMPLE

it follows that a(n)+a(n-1)=A000203(n)

MATHEMATICA

f[x_] := DivisorSigma[1, x]-f[x-1] f[0]=1; Table[f[w], {w, 1, 100}]

CROSSREFS

Cf. A000213, A083236, A083237.

Sequence in context: A096614 A011002 A113817 this_sequence A117782 A116609 A124846

Adjacent sequences: A083235 A083236 A083237 this_sequence A083239 A083240 A083241

KEYWORD

sign

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Apr 23 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research