Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A124839
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A124839 Inverse binomial transform of the Mobius sequence mu(n), A008683. +0
2
1, -2, 2, -1, -2, 10, -30, 76, -173, 363 (list; graph; listen)
OFFSET

0,2

COMMENT

C.f. binomial transform of the diagonalized form of this sequence.

FORMULA

Left border of finite difference rows of Mobius sequence.

EXAMPLE

Given (1, -1, -1, 0, -1...) taking finite differences, we obtain the array:

1, -1, -1, 0, -1, 1, -1...

__ -2, 0 1, -1, 2, -2...

_____ 2, 1, -2, 3, -4...

_________-1, -3, 5, -7...

____________-2, 8, -12...

______________ 10, -20...

__________________-30...

Left border = A124839

CROSSREFS

Cf. A124840.

Sequence in context: A057227 A005007 A014243 this_sequence A117046 A077653 A077889

Adjacent sequences: A124836 A124837 A124838 this_sequence A124840 A124841 A124842

KEYWORD

sign

AUTHOR

Gary W. Adamson (qntmpkt(AT)yahoo.com), Nov 10 2006

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research