Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A101172
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A101172 Sequence whose Mobius transform leads to the first differences of the terms. +0
2
1, 2, 3, 5, 8, 15, 26, 51, 97, 191, 373, 745, 1472, 2943, 5859, 11708, 23365, 46729, 93349, 186697, 373200, 746372, 1492370, 2984739, 5968687, 11937366, 23873259, 47746421, 95489896, 190979791, 381953529, 763907057, 1527790748, 1527802406 (list; graph; listen)
OFFSET

1,2

COMMENT

In the example, the last value in the Mobius transform of [1,2,3,5,8] is 7 and so the next term in our sequence is 8+7=15. Then, the Mobius transform of [1,2,3,5,8,15] is [1,1,2,3,7,11], which means that the next term of our sequence is 15+11=26, etc.

EXAMPLE

For example, the Mobius transform of the segment [1,2,3,5,8] begins [1,1,2,3], which are the first differences of these terms.

MAPLE

with(numtheory): F:={1}: f:=n->F[n]: g:=n->sum(mobius(divisors(n)[j])*f(n/divisors(n)[j]), j=1..tau(n)): for n from 1 to 35 do F:=F union {F[nops(F)]+g(n)} od: G:=sort(convert(F, list)); (Deutsch)

CROSSREFS

Sequence in context: A054539 A026702 A000047 this_sequence A006544 A110536 A049861

Adjacent sequences: A101169 A101170 A101171 this_sequence A101173 A101174 A101175

KEYWORD

easy,nonn

AUTHOR

Mark Hudson (mrmarkhudson(AT)hotmail.com), Dec 03 2004

EXTENSIONS

Corrected and extended by Emeric Deutsch (deutsch(AT)duke.poly.edu), Feb 15 2005

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 December 19 12:50 EST 2009. Contains 171053 sequences.


AT&T Labs Research