Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A141256
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A141256 An Okazaki-like composition, see A126759. +0
2
1, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 4, 2, 5, 3, 2, 2, 6, 2, 7, 2, 3, 4, 8, 2, 2, 5, 2, 3, 9, 2, 10, 2, 4, 6, 3, 2, 11, 7, 5, 2, 12, 3, 13, 4, 2, 8, 14, 2, 15, 2, 6, 5, 16, 2, 4, 3, 7, 9, 17, 2, 18, 10, 3, 2, 5, 4, 19, 6, 8, 3, 20, 2, 21, 11, 2, 7, 22, 5, 23, 2, 2, 12, 24, 3, 6, 13, 9, 4, 25, 2, 26, 8, 10, 14 (list; graph; listen)
OFFSET

0,2

COMMENT

a(5*n) = a(3*n) = a(2*n) = a(n);

for n with GCD(n,30)=1: a(n+30*k)=a(n)+8*k, note: 30=2*3*5,

A000010(30)=8;

for k>1: a(A007775(k-1))=k and a(m)<k for m<A007775(k-1).

LINKS

R. Zumkeller, Table of n, a(n) for n = 0..10000

FORMULA

a(n) = if n=0 then 1 else if GCD(n,30)>1 then a(LPD(n)) else 2*floor(n/30) + (if n mod 30 = 1 then 2 else IP(n)-1), with IP=A049084, LPD=A032742 and GCD=A050873.

CROSSREFS

Sequence in context: A024708 A096917 A068049 this_sequence A131841 A122921 A108128

Adjacent sequences: A141253 A141254 A141255 this_sequence A141257 A141258 A141259

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jun 17 2008

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 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research