Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A091828
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A091828 a(n)=n-2*valuation(A000254(n),3). +0
1
1, 0, 3, 4, 5, 2, 1, 4, 5, 6, 7, 6, 7, 8, 7, 8, 9, 4, 5, 6, 3, 2, 5, 6, 7, 8, 7, 8, 9, 8, 9, 10, 9, 10, 11, 8, 9, 10, 9, 10, 11, 10, 11, 12, 9, 10, 11, 10, 11, 12, 11, 12, 13, 6, 7, 8, 7, 8, 9, 8, 9, 10, 5, 6, 7, 4, 5, 6, 7, 8, 9, 8, 9, 10, 9, 10, 11, 10, 11, 12, 9, 10, 11, 10, 11, 12, 11, 12, 13 (list; graph; listen)
OFFSET

1,3

FORMULA

For n>7 a(3n)=a(n)+2; a(3n+1)=a(n)+3; (3n+2)=a(n)+4

PROGRAM

(PARI) a(n)=if(n<2, 1, n-2*valuation(n!*sum(i=1, n, 1/i), 3))

CROSSREFS

Cf. A056792.

Sequence in context: A135347 A144786 A009389 this_sequence A121845 A099816 A099120

Adjacent sequences: A091825 A091826 A091827 this_sequence A091829 A091830 A091831

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Mar 09 2004

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 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research