Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A085193
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A085193 Repeating part of A085192. +0
5
2, 6, 2, 4, 18, 2, 6, 2, 4, 10, 2, 4, 8, 58, 2, 6, 2, 4, 18, 2, 6, 2, 4, 10, 2, 4, 8, 26, 2, 6, 2, 4, 10, 2, 4, 8, 18, 2, 4, 8, 16, 202, 2, 6, 2, 4, 18, 2, 6, 2, 4, 10, 2, 4, 8, 58, 2, 6, 2, 4, 18, 2, 6, 2, 4, 10, 2, 4, 8, 26, 2, 6, 2, 4, 10, 2, 4, 8, 18, 2, 4, 8, 16, 74, 2, 6, 2, 4, 18, 2, 6, 2, 4, 10 (list; graph; listen)
OFFSET

0,1

LINKS

A. Karttunen, Notes concerning A080237-tree and related sequences.

FORMULA

a(n) = A085192(A081291(n+1)-1)

a(n) = 4*A085193(A085182(n+1)-1) + 2 - (2^A007001(n+1)) if A007001(n+2)==1, otherwise 2^A007001(n+1).

PROGRAM

(MIT Scheme) (define (A085193 nn) (let ((n (1+ nn))) (cond ((= 1 (A007001 (+ n 1))) (- (* 4 (A085193 (-1+ (A085182 n)))) (- (expt 2 (A007001 n)) 2))) (else (expt 2 (A007001 n))))))

CROSSREFS

Same sequence divided by 2: A085194. Cf. A085190.

Sequence in context: A073094 A057606 A021385 this_sequence A060295 A102912 A064850

Adjacent sequences: A085190 A085191 A085192 this_sequence A085194 A085195 A085196

KEYWORD

nonn

AUTHOR

Antti Karttunen (my_firstname.my_surname(AT)iki.fi) Jun 14 2003

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research