login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A088318 Number of different values of A007947(m_k) when A007947(m_j) = A007947(m_k) and A056239(m_j) = A056239(m_k) = n, where k>1 ( j runs from 1 to k-1 ). 1

%I #2 Mar 31 2012 20:01:48

%S 0,0,0,0,1,1,2,3,5,7,10,13,18,24,32,40,51,66,83,103,128,158,194,237,

%T 288,348,419,500,612

%N Number of different values of A007947(m_k) when A007947(m_j) = A007947(m_k) and A056239(m_j) = A056239(m_k) = n, where k>1 ( j runs from 1 to k-1 ).

%e a(7)=2 because there are two different values. ( 10 and 6 ):

%e m_1=50, m_2=80, 10 = A007947(50) = A007947(80) and A056239(50) = A056239(80) = 7.

%e m_1=54, m_2=72, m_3=96, 6 = A007947(54) = A007947(72) = A007947(96) and A056239(54) = A056239(72) = A056239(96) = 7.

%K easy,nonn

%O 1,7

%A _Naohiro Nomoto_, Nov 06 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 19:02 EDT 2024. Contains 371798 sequences. (Running on oeis4.)