Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A106495
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A106495 Number of leaves in GF(2)[X] superfactorization of n. +0
6
1, 1, 1, 1, 1, 2, 1, 1, 2, 2, 1, 2, 1, 2, 1, 1, 1, 3, 1, 2, 1, 2, 2, 2, 1, 2, 2, 2, 2, 2, 1, 1, 2, 2, 2, 3, 1, 2, 2, 2, 1, 2, 2, 2, 2, 3, 1, 2, 2, 2, 1, 2, 2, 3, 1, 2, 2, 3, 1, 2, 1, 2, 2, 2, 2, 3, 1, 2, 1, 3, 2, 3, 1, 2, 2, 2, 2, 3, 2, 2, 1, 2, 3, 2, 2, 3, 1, 2, 2, 3, 1, 3, 2, 2, 2, 2, 1, 3, 2, 2, 3, 2 (list; graph; listen)
OFFSET

1,6

LINKS

A. Karttunen, Scheme-program for computing this sequence.

FORMULA

a(n) = A106494(n)-A106493(n).

CROSSREFS

a(n) = A064372(A106445(n)). After n=1 differs from A091221 for the first time at n=64, where A091221(64)=1, while a(64)=2.

Sequence in context: A154402 A023396 A091221 this_sequence A100428 A093914 A007061

Adjacent sequences: A106492 A106493 A106494 this_sequence A106496 A106497 A106498

KEYWORD

nonn

AUTHOR

Antti Karttunen (His-Firstname.His-Surname(AT)gmail.com), May 09 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 27 14:46 EST 2009. Contains 167570 sequences.


AT&T Labs Research