Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A007731
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A007731 a(n)=a([ n/2 ])+a([ n/3 ])+a([ n/6 ]). +0
7
1, 3, 5, 7, 9, 9, 15, 15, 17, 19, 19, 19, 29, 29, 29, 29, 31, 31, 41, 41, 41, 41, 41, 41, 55, 55, 55, 57, 57, 57, 57, 57, 59, 59, 59, 59, 85, 85, 85, 85, 85, 85, 85, 85, 85, 85, 85, 85, 103, 103, 103, 103, 103, 103, 117, 117 (list; graph; listen)
OFFSET

0,2

LINKS

T. D. Noe, Table of n, a(n) for n=0..10000

P. Erdos, A. Hildebrand, A. Odlyzko, P. Pudaite and B. Reznick, The asymptotic behavior of a family of sequences, Pacific J. Math., 126 (1987), pp. 227-241.

FORMULA

From given link, a(n) is asymptotic to c*n where c = 12/log(432) = 1.97744865.. - Benoit Cloitre (benoit7848c(AT)orange.fr), Dec 18 2002

MAPLE

A007731 := proc(n) option remember; if n=0 then RETURN(1) else RETURN( A007731(trunc(n/2))+A007731(trunc(n/3))+A007731(trunc(n/6))); fi; end;

CROSSREFS

A083662, A088468, A165704, A165706. [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Sep 26 2009]

Sequence in context: A161821 A139083 A139081 this_sequence A079377 A047747 A007957

Adjacent sequences: A007728 A007729 A007730 this_sequence A007732 A007733 A007734

KEYWORD

nonn,easy,nice

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

page 1

Search completed in 0.005 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