Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A105672
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A105672 a(1)=1 then letting f(n)=3^n for f(n)<k<=f(n+1) a(k)=f(n+1)-a(k-f(n)) (b(n,3) using pari code). +0
5
1, 2, 1, 8, 7, 8, 1, 2, 1, 26, 25, 26, 19, 20, 19, 26, 25, 26, 1, 2, 1, 8, 7, 8, 1, 2, 1, 80, 79, 80, 73, 74, 73, 80, 79, 80, 55, 56, 55, 62, 61, 62, 55, 56, 55, 80, 79, 80, 73, 74, 73, 80, 79, 80, 1, 2, 1, 8, 7, 8, 1, 2, 1, 26, 25, 26, 19, 20, 19, 26, 25, 26, 1, 2, 1, 8, 7, 8, 1, 2, 1 (list; graph; listen)
OFFSET

1,2

FORMULA

a(n+1)=1+sum(k=1, n, (-1)^k*(2-3*3^valuation(k, 3)))

PROGRAM

(PARI) b(n, m)=if(n<2, 1, m*m^floor(log(n-1)/log(m))-b(n-m^floor(log(n-1)/log(m)), m))

CROSSREFS

Cf. A105669, A105670, A093347, A093348.

Adjacent sequences: A105669 A105670 A105671 this_sequence A105673 A105674 A105675

Sequence in context: A049250 A060587 A081800 this_sequence A005489 A015152 A021461

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), May 03 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 November 8 07:45 EST 2009. Contains 166143 sequences.


AT&T Labs Research