Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A067926
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A067926 a(n)=phi(n^2+1)/n if (n^2+1) is composite and phi(n^2+1)==0 (mod n). +0
1
6, 25, 48, 60, 98, 150, 192, 304, 336, 896, 990, 800, 1248, 1232, 1210, 1105, 1798, 2448, 2790, 4032, 5166, 5095, 7488, 8925, 9798, 8484, 12540, 12528, 14448, 14112, 15994, 12950, 19998, 21312, 21222, 24198, 12288, 35768, 26560, 33792, 46620 (list; graph; listen)
OFFSET

1,1

COMMENT

If n^2+1 is prime, trivially phi(n^2+1)/n=n.

CROSSREFS

Cf. A066820.

Sequence in context: A042495 A018198 A079606 this_sequence A075224 A042185 A065069

Adjacent sequences: A067923 A067924 A067925 this_sequence A067927 A067928 A067929

KEYWORD

easy,nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Feb 22 2002

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 30 22:12 EST 2008. Contains 150989 sequences.


AT&T Labs Research