Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A111800
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A111800 Order of the rote (rooted odd tree with only exponent symmetries) for n. +0
19
1, 3, 5, 5, 7, 7, 7, 7, 7, 9, 9, 9, 9, 9, 11, 7, 9, 9, 9, 11, 11, 11, 9, 11, 9, 11, 9, 11, 11, 13, 11, 9, 13, 11, 13, 11, 11, 11, 13, 13, 11, 13, 11, 13, 13, 11, 13, 11, 9, 11, 13, 13, 9, 11, 15, 13, 13, 13, 11, 15, 11, 13, 13, 9, 15, 15, 11, 13, 13, 15, 13, 13, 13, 13, 13, 13, 15, 15 (list; graph; listen)
OFFSET

1,2

COMMENT

A061396(n) gives the number of times that 2n+1 appears in this sequence.

LINKS

Jon Awbrey, Illustrations of Rotes for Small Integers

FORMULA

a(Prod(p_i^e_i)) = 1 + Sum(a(i) + a(e_i)), product over nonzero e_i in prime factorization of n.

EXAMPLE

Writing prime(i)^j as i:j, and using equal signs between identified nodes:

2500 = 4 * 625 = 2^2 5^4 = 1:2 3:4 has the following rote:

` ` ` ` ` ` ` `

` ` ` o-o ` o-o

` ` ` | ` ` | `

` o-o o-o o-o `

` | ` | ` | ` `

o-o ` o---o ` `

| ` ` | ` ` ` `

O=====O ` ` ` `

` ` ` ` ` ` ` `

So a(2500) = a(1:2 3:4) = a(1)+a(2)+a(3)+a(4)+1 = 1+3+5+5+1 = 15.

CROSSREFS

Cf. A061396, A062504, A062537, A062860, A106177, A109300, A109301.

Sequence in context: A103988 A086269 A057952 this_sequence A126611 A103332 A079886

Adjacent sequences: A111797 A111798 A111799 this_sequence A111801 A111802 A111803

KEYWORD

nonn

AUTHOR

Jon Awbrey, Aug 17, 2005, based on calculations by David W. Wilson

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 July 23 17:35 EDT 2008. Contains 142285 sequences.


AT&T Labs Research