### References to node

*130 seqfan posts*

*Mon Jun 11 02:04:25 CEST 2012* [seqfan] Re: Request for help with mystery sequence N0320 = A213385

*Mon Jun 11 00:05:16 CEST 2012* [seqfan] Request for help with mystery sequence N0320 = A213385

*Fri May 18 09:33:22 CEST 2012* [seqfan] Re: Help needed with A007863 Number of hybrid binary trees with n nodes.

*Fri May 18 09:24:59 CEST 2012* [seqfan] Re: Help needed with A007863 Number of hybrid binary trees with n nodes.

*Fri May 18 04:31:55 CEST 2012* [seqfan] Help needed with A007863 Number of hybrid binary trees with n nodes.

*Sat May 12 06:06:12 CEST 2012* [seqfan] Re: partition of a circle

*Sat May 12 00:56:01 CEST 2012* [seqfan] Re: partition of a circle

*Fri May 11 18:06:30 CEST 2012* [seqfan] Re: partition of a circle

*Fri May 11 17:45:14 CEST 2012* [seqfan] Re: partition of a circle (WL 2).

*Fri May 11 17:35:57 CEST 2012* [seqfan] Re: partition of a circle

*Fri May 11 12:08:59 CEST 2012* [seqfan] Re: partition of a circle

*Fri May 11 09:10:57 CEST 2012* [seqfan] partition of a circle

*Fri May 11 03:45:18 CEST 2012* [seqfan] Re: partitions of a circle

*Sun Apr 8 15:34:44 CEST 2012* [seqfan] Re: graphs with odd degrees

*Sun Apr 8 15:29:53 CEST 2012* [seqfan] Re: graphs with odd degrees

*Sun Apr 8 04:11:07 CEST 2012* [seqfan] Re: graphs with odd degrees

*Sat Apr 7 07:58:32 CEST 2012* [seqfan] Re: graphs with odd degrees

*Fri Apr 6 15:51:43 CEST 2012* [seqfan] Re: graphs with odd degrees

*Fri Apr 6 14:58:30 CEST 2012* [seqfan] Re: graphs with odd degrees

*Fri Apr 6 15:59:18 CEST 2012* [seqfan] Re: graphs with odd degrees

*Fri Apr 6 15:34:09 CEST 2012* [seqfan] Re: graphs with odd degrees

*Fri Apr 6 15:27:22 CEST 2012* [seqfan] Re: graphs with odd degrees

*Fri Apr 6 12:11:13 CEST 2012* [seqfan] Re: graphs with odd degrees

*Thu Apr 5 18:50:31 CEST 2012* [seqfan] Re: graphs with odd degrees

*Thu Apr 5 17:27:41 CEST 2012* [seqfan] Re: graphs with odd degrees

*Tue Dec 13 15:39:32 CET 2011* [seqfan] Re: Hetero-labeled trees

*Tue Dec 13 15:37:16 CET 2011* [seqfan] Re: Hetero-labeled trees

*Wed Nov 16 19:52:20 CET 2011* [seqfan] Re: Counting cycles in graphs - was Re: A200000

*Wed Nov 16 11:16:54 CET 2011* [seqfan] Re: Counting cycles in graphs - was Re: A200000

*Tue Nov 15 16:59:02 CET 2011* [seqfan] Re: A200000

*Tue Nov 15 09:53:32 CET 2011* [seqfan] Counting cycles in graphs - was Re: A200000

*Tue Nov 15 06:00:35 CET 2011* [seqfan] Re: A200000

*Thu Nov 3 18:23:40 CET 2011* [seqfan] Re: Intersections of x^x^...^x

*Thu Nov 3 11:53:43 CET 2011* [seqfan] Re: Intersections of x^x^...^x

*Sat Oct 29 15:21:33 CEST 2011* [seqfan] Re: Set of sets using minimal number of braces

*Sat Oct 29 09:05:57 CEST 2011* [seqfan] Re: Set of sets using minimal number of braces

*Tue Oct 25 09:08:36 CEST 2011* [seqfan] Re: Set of sets using minimal number of braces

*Sat Oct 15 21:22:47 CEST 2011* [seqfan] binary tree sequences

*Sun Sep 18 08:06:54 CEST 2011* [seqfan] Re: Definitions of "circular rooted trees, " "series-reduced mobiles, " "cycle rooted trees, " "asymmetric mobiles"

*Sun Sep 26 23:30:37 CEST 2010* [seqfan] Re: graph terminology

*Sat Sep 25 23:44:03 CEST 2010* [seqfan] graph terminology

*Sat Aug 7 19:21:18 CEST 2010* [seqfan] A combinatorial problem: generalization

*Tue Aug 3 16:36:38 CEST 2010* [seqfan] Re: A combinatorial problem

*Thu Jul 8 03:05:54 CEST 2010* [seqfan] Looking for help with a sequence: the longest non self - intersecting path through a cube

*Wed Jun 9 22:12:05 CEST 2010* [seqfan] Re: looking for bijections

*Wed Jun 9 13:17:26 CEST 2010* [seqfan] Re: looking for bijections

*Wed Jun 9 13:11:04 CEST 2010* [seqfan] Re: looking for bijections

*Tue Jun 8 17:47:47 CEST 2010* [seqfan] Re: looking for bijections

*Tue Jun 8 10:47:06 CEST 2010* [seqfan] Re: looking for bijections

*Sat Jun 5 05:07:03 CEST 2010* [seqfan] looking for bijections

*Wed Jun 2 14:04:57 CEST 2010* [seqfan] Re: A048200 variant: invert [1, 2, ..., n] allowing one swap and two shift-rotate operations

*Wed May 19 10:02:52 CEST 2010* [seqfan] Re: A method to generate sequences

*Tue May 18 16:52:55 CEST 2010* [seqfan] Re: A method to generate sequences

*Tue Apr 27 09:24:02 CEST 2010* [seqfan] Re: Prime and composite walks concatenated

*Mon Apr 26 17:18:17 CEST 2010* [seqfan] Re: Prime and composite walks concatenated

*Sun Apr 18 13:28:30 CEST 2010* [seqfan] graphs by connectivity

*Tue Mar 23 16:22:56 CET 2010* [seqfan] Animated Proofs & Cactus Logic

*Sun Mar 21 23:39:43 CET 2010* [seqfan] Cross-References to A006820

*Sun Mar 14 13:37:17 CET 2010* [seqfan] Re: Mystery tour with a(n)=sigma(a(n-1))

*Sun Mar 14 13:13:53 CET 2010* [seqfan] Re: Help needed

*Sun Mar 14 03:25:28 CET 2010* [seqfan] Re: Help needed

*Sun Mar 14 03:25:28 CET 2010* [seqfan] Re: Help needed

*Fri Mar 12 23:59:47 CET 2010* [seqfan] Re: Help needed

*Fri Mar 12 23:54:01 CET 2010* [seqfan] Help needed

*Fri Mar 12 23:54:01 CET 2010* [seqfan] Help needed

*Fri Mar 12 14:58:50 CET 2010* [seqfan] The Fuer Elise sequences

*Wed Feb 24 21:19:04 CET 2010* [seqfan] Re: article by Paul Taurau on bijections to naturals

*Tue Feb 23 09:09:26 CET 2010* [seqfan] article by Paul Taurau on bijections to naturals

*Thu Feb 18 15:46:01 CET 2010* [seqfan] Re: Mystery tour with a(n)=sigma(a(n-1))

*Wed Feb 17 18:26:33 CET 2010* [seqfan] Re: Mystery tour with a(n)=sigma(a(n-1))

*Wed Feb 17 18:26:33 CET 2010* [seqfan] Re: Mystery tour with a(n)=sigma(a(n-1))

*Wed Feb 17 18:06:29 CET 2010* [seqfan] Re: Mystery tour with a(n)=sigma(a(n-1))

*Thu Feb 11 23:07:44 CET 2010* [seqfan] Re: definition of A002848

*Tue Feb 9 23:46:07 CET 2010* [seqfan] Re: Number of Euler graphs: A002854 or something else?

*Sun Feb 7 22:48:00 CET 2010* [seqfan] Re: Seqfan Digest, Vol 17, Issue 2

*Fri Feb 5 09:53:00 CET 2010* [seqfan] Re: Number of Euler graphs: A002854 or something else?

*Fri Feb 5 02:15:55 CET 2010* [seqfan] Re: Number of Euler graphs: A002854 or something else?

*Fri Feb 5 02:08:52 CET 2010* [seqfan] Re: Number of Euler graphs: A002854 or something else?

*Fri Feb 5 01:56:38 CET 2010* [seqfan] Re: Number of Euler graphs: A002854 or something else?

*Thu Jan 28 19:04:27 CET 2010* [seqfan] Re: Number of Euler graphs: A002854 or something else?

*Thu Jan 28 17:59:58 CET 2010* [seqfan] Re: Number of Euler graphs: A002854 or something else?

*Thu Jan 28 06:13:17 CET 2010* [seqfan] Number of Euler graphs: A002854 or something else?

*Mon Jan 11 18:24:37 CET 2010* [seqfan] Toothpicks A139250 defines set of graphs

*Wed Jan 6 02:17:00 CET 2010* [seqfan] Re: A graph counting problem

*Wed Jan 6 01:30:48 CET 2010* [seqfan] Re: A graph counting problem

*Tue Jan 5 23:55:25 CET 2010* [seqfan] Re: A graph counting problem

*Sat Jan 2 16:36:01 CET 2010* [seqfan] Re: A graph counting problem

*Thu Dec 31 11:09:34 CET 2009* [seqfan] Re: A graph counting problem

*Wed Dec 30 16:20:51 CET 2009* [seqfan] A graph counting problem

*Wed Dec 30 00:00:57 CET 2009* [seqfan] Re: Help wanted on A005646 connection to A000055

*Tue Dec 29 12:21:35 CET 2009* [seqfan] Re: Help wanted on A005646 connection to A000055

*Tue Dec 29 02:55:03 CET 2009* [seqfan] Help wanted on A005646 connection to A000055

*Thu Dec 17 01:20:11 CET 2009* [seqfan] Re: Best intro to the Janet periodic table?

*Wed Dec 16 19:34:01 CET 2009* [seqfan] Re: a question about arrangements of pennies

*Mon Dec 14 08:08:49 CET 2009* [seqfan] Re: a question about arrangements of pennies

*Mon Dec 14 05:56:58 CET 2009* [seqfan] Re: a question about arrangements of pennies

*Mon Dec 14 05:02:26 CET 2009* [seqfan] a question about arrangements of pennies

*Sun Nov 15 07:58:58 CET 2009* [seqfan] number of k-cycles for n-simplex, n-cube, n-orthoplex (Also Errors in A085452)

*Sat Nov 14 21:00:55 CET 2009* [seqfan] Re: Error?

*Fri Oct 23 09:34:20 CEST 2009* [seqfan] Re: Multiplicative Graphs

*Fri Oct 23 07:04:51 CEST 2009* [seqfan] Re: Multiplicative Graphs

*Fri Oct 23 03:06:18 CEST 2009* [seqfan] Re: Multiplicative Graphs

*Fri Oct 23 03:06:18 CEST 2009* [seqfan] Re: Multiplicative Graphs

*Fri Oct 23 03:05:02 CEST 2009* [seqfan] Re: Multiplicative Graphs

*Fri Oct 23 03:05:02 CEST 2009* [seqfan] Re: Multiplicative Graphs

*Thu Oct 22 11:06:48 CEST 2009* [seqfan] Multiplicative Graphs

*Sat Sep 26 01:20:37 CEST 2009* [seqfan] Re: boxes in boxes

*Fri Sep 25 22:58:04 CEST 2009* [seqfan] boxes in boxes

*Thu Sep 3 16:03:25 CEST 2009* [seqfan] Re: Another chemistry related sequence?

*Thu Sep 3 15:51:20 CEST 2009* [seqfan] Re: Another chemistry related sequence?

*Tue Jun 16 19:26:26 CEST 2009* [seqfan] Levenshtein distances with hyphenated number names

*Tue Jun 9 09:48:51 CEST 2009* [seqfan] Re: functions f:[n]->[n] such that f[(2*x) mod n]=[2*f(x)]

*Tue Jun 9 04:38:25 CEST 2009* [seqfan] functions f:[n]->[n] such that f[(2*x) mod n]=[2*f(x)]

*Sat Jun 6 01:11:07 CEST 2009* [seqfan] Re: Add to an integer its distinct factors and loop

*Fri Jun 5 21:34:12 CEST 2009* [seqfan] Re: Add to an integer its distinct factors and loop

*Sun Mar 15 05:09:28 CET 2009* [seqfan] Another conjecture concerning Eulerian graphs: A084554 = A007127

*Sun Mar 15 04:22:08 CET 2009* [seqfan] Re: A conjecture concerning connected rooted strength 1 Eulerian graphs with n nodes

*Fri Mar 13 11:54:16 CET 2009* [seqfan] Re: A conjecture concerning connected rooted strength 1Eulerian graphs with n nodes

*Fri Mar 13 11:10:08 CET 2009* [seqfan] Re: A conjecture concerning connected rooted strength 1 Eulerian graphs with n nodes

*Fri Mar 13 10:02:55 CET 2009* [seqfan] Re: A conjecture concerning connected rooted strength 1 Eulerian graphs with n nodes

*Fri Mar 13 07:29:55 CET 2009* [seqfan] Re: A conjecture concerning connected rooted strength 1 Eulerian graphs with n nodes

*Thu Mar 12 20:49:51 CET 2009* [seqfan] Re: A conjecture concerning connected rooted strength 1 Eulerian graphs with n nodes

*Thu Mar 12 20:28:41 CET 2009* [seqfan] Re: A conjecture concerning connected rooted strength 1 Eulerian graphs with n nodes

*Thu Mar 12 20:24:17 CET 2009* [seqfan] Re: A conjecture concerning connected rooted strength 1 Eulerian graphs with n nodes

*Thu Mar 12 17:27:32 CET 2009* [seqfan] Re: A conjecture concerning connected rooted strength 1 Eulerian graphs with n nodes

*Thu Mar 12 16:16:39 CET 2009* [seqfan] A conjecture concerning connected rooted strength 1 Eulerian graphs with n nodes

*Fri Mar 6 21:10:50 CET 2009* [seqfan] Number of Trees

*Sun Dec 28 18:50:04 CET 2008* [seqfan] An interesting coincidence

*Fri Dec 26 23:06:26 CET 2008* [seqfan] Some items inspired by appearances of 2009 in the OEIS

*Fri Dec 26 17:04:24 CET 2008* [seqfan] Comments to sequences concerning "forests"

Index of A-numbers in seqfan: by ascending order
by month
by frequency
by keyword

node

Links to OEIS content are included according to
The OEIS End-User License Agreement
.